Static Analysis of Communicating Processes Using Symbolic Transducers

DOI10.1007/978-3-319-52234-0_5zbMath1484.68097arXiv1611.07812OpenAlexW2549993418MaRDI QIDQ2961555

Vincent Botbol, Tristan Le Gall, Emmanuel Chailloux

Publication date: 21 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.07812

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Static Analysis of Communicating Processes Using Symbolic Transducers

Uses Software

• Apron
• Frama-C
• ISP
• MPI
• Checkmate

Cites Work

• The octagon abstract domain
• Relational Thread-Modular Static Value Analysis by Abstract Interpretation
• Symbolic finite state transducers
• Static Analysis of Communicating Processes Using Symbolic Transducers
• Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification
• CONCUR 2004 - Concurrency Theory
• Computer Aided Verification

This page was built for publication: Static Analysis of Communicating Processes Using Symbolic Transducers