3333 search results - page 44 / 667 » Abstract Proof Search |
FUN
2007
Springer
15 years 4 months ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
FROCOS
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Nowadays, formal methods rely on tools of different kinds: proof assistants with which the user interacts to discover a proof step by step; and fully automated tools whic...
ICFEM
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We present a practical approach to a formal analysis of UMLbased models. This is achieved by an underlying formal representation in Z, which allows us to pose and dischar...
TPHOL
1991
IEEE
15 years 1 months ago
1991
IEEE
D ABSTRACT) Ramayya Kumar, Thomas Kropf, Klaus Schneider University of Karlsruhe,Institute of ComputerDesign and Fault Tolerance (Prof.Dr.D. Schmid) P.O. Box 6980, W-7500 Karlsruhe...
ROOM
2000
14 years 11 months ago
2000
This paper proposes a new calculus for expressing the behaviour of object-oriented systems. The semantics of the calculus is given in terms of operators from computational categor...