Using partial orders to improve automatic verification methods. (Extended abstract)

DOI10.1007/BFB0023731MaRDI QIDQ4037382zbMATH OpenFDO

Authors Patrice Godefroid

Publication date 18 May 1993

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

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

zbMATH Keywords

Mazurkiewicz's tracestrace automatonverification method for concurrent finite-state systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 177254
• scientific article; zbMATH DE number 1012604
• scientific article; zbMATH DE number 1059333
• Formal verification of a partial-order reduction technique for model checking
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• scientific article; zbMATH DE number 1182797

Cited in

(35)

• Symbolic model checking: \(10^{20}\) states and beyond
• An algorithmic approach for checking closure properties of temporal logic specifications and -regular languages
• Proving partial order properties
• Petri nets, traces, and local model checking
• \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Compositional reasoning for shared-variable concurrent programs
• Automata-driven partial order reduction and guided search for LTL model checking
• Second-order finite automata
• Deadlock-freedom in component systems with architectural constraints
• Abstract interpretation of microcontroller code: intervals meet congruences
• Lazy slicing for state-space exploration
• Modular synthesis of timed circuits using partial orders on LPNs
• The Implementation of Mazurkiewicz Traces in POEM
• Partial Order Reduction for State/Event LTL
• scientific article; zbMATH DE number 177254 (Why is no real title available?)
• Proving partial order liveness properties
• scientific article; zbMATH DE number 1059328 (Why is no real title available?)
• scientific article; zbMATH DE number 1059333 (Why is no real title available?)
• Reduced state space representation for unbounded vector state spaces
• Second-Order Finite Automata
• Partial order reduction for state/event LTL with application to component-interaction automata
• Stubborn set reduction for two-player reachability games
• Application of partial-order methods to reactive programs with event memorization
• Adding partial orders to linear temporal logic
• An algorithmic approach for checking closure properties of Ω-regular languages
• Towards automata for branching time and partial order
• Complexity results for 1-safe nets
• Compositional correctness and completeness for symbolic partial order reduction
• Offline supervisory control synthesis: taxonomy and recent developments
• On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
• Partial-order reduction is hard
• Upper Bounding Diameters of State Spaces of Factored Transition Systems
• Symmetry and partial order reduction techniques in model checking Rebeca

This page was built for publication: Using partial orders to improve automatic verification methods. (Extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037382)