Automated reformulation of specifications by safe delay of constraints
From MaRDI portal
Publication:2457622
Recommendations
- Executing formal specifications with concurrent constraint programming
- Automating the refinement of specifications for distributed systems via syntactic transformations
- Boosting the reuse of formal specifications
- Pattern-based refinement of assume-guarantee specifications in reactive synthesis
- Modifying LOTOS specifications by means of automatable formula-based integrations
Cites work
- A theory of abstraction
- AI*IA 2005: Advances in Artificial Intelligence
- Combining the scalability of local search with the pruning techniques of systematic search
- Compiling problem specifications into SAT
- Equivalences among Relational Expressions
- Equivalences Among Relational Expressions with the Union and Difference Operators
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 4123296 (Why is no real title available?)
- scientific article; zbMATH DE number 1975610 (Why is no real title available?)
- scientific article; zbMATH DE number 1538056 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 956863 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- Increasing constraint propagation by redundant modeling: An experience report
- Logic Based Program Synthesis and Transformation
- Logic programs with stable model semantics as a constraint programming paradigm
- Logics in Artificial Intelligence
- On conjunctive queries containing inequalities
- Permutation Problems and Channelling Constraints
- Symmetry Breaking and Local Search Spaces
- The DLV system for knowledge representation and reasoning
- Theory and Applications of Satisfiability Testing
Cited in
(4)
This page was built for publication: Automated reformulation of specifications by safe delay of constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457622)