Syntactic program transformations for automatic abstraction
From MaRDI portal
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- Design of syntactic program transformations by abstract interpretation of semantic transformations
- Automatic modular abstractions for linear constraints
- Formal Methods at the Crossroads. From Panacea to Foundational Support
- Abstract and model check while you prove
- Model checking guided abstraction and analysis
Cited in
(16)- Some methods of automatic analysis and controllable transformation of programs
- Test generation from event system abstractions to cover their states and transitions
- Specification and verification of concurrent programs through refinements
- Real-time verification techniques for untimed systems
- Predicate abstraction for dense real-time systems
- Association of under-approximation techniques for generating tests from models
- Combining model checking and testing
- Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data
- Automated discovery of simulation between programs
- Abstraction by symbolic indexing transformations
- Automatic verification of reduction techniques in higher order logic
- Design of syntactic program transformations by abstract interpretation of semantic transformations
- Meanings of model checking
- Automatic modular abstractions for linear constraints
- Syntax-driven reachable state space construction of synchronous reactive programs
- CONCUR 2003 - Concurrency Theory
This page was built for publication: Syntactic program transformations for automatic abstraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754105)
