FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/11590156zbMath1172.68422OpenAlexW2484051058MaRDI QIDQ5897782

Jan Strejček, Javier Esparza, Ahmed Bouajjani, Stefan Schwoon

Publication date: 14 November 2006

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

Full work available at URL: https://doi.org/10.1007/11590156

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (15)

Model Checking Concurrent Programs ⋮ Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-Vous ⋮ Reducing behavioural to structural properties of programs with procedures ⋮ Verifying parallel programs with dynamic communication structures ⋮ When Is Reachability Intrinsically Decidable? ⋮ Faster Algorithms for Weighted Recursive State Machines ⋮ On the Reachability Analysis of Acyclic Networks of Pushdown Systems ⋮ Compositional verification of sequential programs with procedures ⋮ Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism ⋮ A calculus of branching processes ⋮ Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads ⋮ Interprocedural Analysis of Concurrent Programs Under a Context Bound ⋮ Context-Bounded Analysis of Concurrent Queue Systems ⋮ Reasoning about Threads with Bounded Lock Chains ⋮ Verifying Parallel Programs with Dynamic Communication Structures

This page was built for publication: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science