Foundations of logic programming
Foundations of logic programming
Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Relational queries computable in polynomial time
Information and Control
Embedding boolean expressions into logic programming
Journal of Symbolic Computation
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Communications of the ACM
An implementation of an efficient algorithm for bisimulation equivalence
Science of Computer Programming
Handbook of theoretical computer science (vol. B)
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Detecting embedded Horn structure in propositional logic
Information Processing Letters
Abstract interpretation and application to logic programs
Journal of Logic Programming
Global flow analysis as a practical compilation tool
Journal of Logic Programming
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Groundness analysis for Prolog: implementation and evaluation of domain prop
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Analysing logic programs using “prop”-ositional logic programs and a magic wand
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
A machine program for theorem-proving
Communications of the ACM
Symbolic Model Checking
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Symbolic Model Checking and Constraint Logic Programming: a Cross-Fertilization
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
Yet Another Application for Topie: Verification of Mutual Exclusion Algorithms
LPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning
PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
MEC: A System for Constructing and Analysing Transition Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Faster Model Checking for the Modal Mu-Calculus
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Delay Analysis in Synchronous Programs
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Unification in Finite Algebras is Unitary (?)
Proceedings of the 9th International Conference on Automated Deduction
Generating BDDs for symbolic model checking in CCS
Distributed Computing
On proving left termination of constraint logic programs
ACM Transactions on Computational Logic (TOCL)
On temporal logic versus datalog
Theoretical Computer Science - Logic and complexity in computer science
| Hi-index | 0.00 |
In this paper, we report experiments we did with the constraint languageToupie. Toupie is a finite-domain µ-calculus interpreter. In additionto classical functionalities of a finite-domain constraint solver, itprovides a full universal quantification, and relations(predicates/constraints) can be defined as least or greatest fixpoints ofequations. This expressiveness is coupled with a practical efficiency thatcomes from the management of relations via decision diagrams. We advocatethe use of this paradigm to model and solve efficiently difficult constraintproblems such as the computation of properties of finite-state machines andthe implementation of abstract interpretation algorithms for logic languages.