Sciweavers

937 search results - page 15 / 188
» On the Complexity of Partial Order Properties
Sort
View
AGP
1994
IEEE
15 years 2 months ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
CSL
1999
Springer
15 years 2 months ago
Anti-Symmetry of Higher-Order Subtyping
This paper gives the first proof that the subtyping relation of a higherorder lambda calculus, Fω ≤, is anti-symmetric, establishing in the process that the subtyping relation...
Adriana B. Compagnoni, Healfdene Goguen
ATVA
2008
Springer
131views Hardware» more  ATVA 2008»
14 years 11 months ago
Dynamic Model Checking with Property Driven Pruning to Detect Race Conditions
We present a new property driven pruning algorithm in dynamic model checking to efficiently detect race conditions in multithreaded programs. The main idea is to use a lockset base...
Chao Wang, Yu Yang, Aarti Gupta, Ganesh Gopalakris...
ISMVL
2008
IEEE
126views Hardware» more  ISMVL 2008»
15 years 4 months ago
Betweenness, Metrics and Entropies in Lattices
We investigate a class of metrics on lattices that are compatible with the partial order defined by the lattice using the ternary relation of betweenness that can be naturally de...
Dan A. Simovici
ACL
2001
14 years 11 months ago
Word Order in German: A Formal Dependency Grammar Using a Topological Hierarchy
This paper proposes a description of German word order including phenomena considered as complex, such as scrambling, (partial) VP fronting and verbal pied piping. Our description...
Kim Gerdes, Sylvain Kahane