Sciweavers

2409 search results - page 109 / 482
» Logical systems for structured specifications
Sort
View
ICLP
1992
Springer
15 years 10 months ago
Records for Logic Programming
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
Gert Smolka, Ralf Treinen
WADT
2004
Springer
15 years 11 months ago
Theoroidal Maps as Algebraic Simulations
Abstract. Computational systems are often represented by means of Kripke structures, and related using simulations. We propose rewriting logic as a flexible and executable framewo...
Narciso Martí-Oliet, José Meseguer, ...
174
Voted
CSL
2003
Springer
15 years 11 months ago
Atomic Cut Elimination for classical Logic
System SKS is a set of rules for classical propositional logic presented in the calculus of structures. Like sequent systems and unlike natural deduction systems, it has an explici...
Kai Brünnler
SIMPRA
2008
137views more  SIMPRA 2008»
15 years 5 months ago
An admissible-behaviour-based analysis of the deadlock in Petri-net controllers
This paper addresses the problem of verifying the discrete control logic that is typically implemented by programmable controllers. Not only are the logical properties of the cont...
G. Music, Drago Matko
KBSE
2000
IEEE
15 years 9 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula