Sciweavers

662 search results - page 65 / 133
» Logic Programming with Ordered Disjunction
Sort
View
ENTCS
2002
91views more  ENTCS 2002»
13 years 8 months ago
Subtyping in Logical Form
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...
Ugo de'Liguoro
TBILLC
2005
Springer
14 years 2 months ago
Natural Logic for Natural Language
We implement the extension of the logical consequence relation to a partial order ā‰¤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the deļ...
Jan van Eijck
SC
2009
ACM
14 years 3 months ago
Scalable temporal order analysis for large scale debugging
We present a scalable temporal order analysis technique that supports debugging of large scale applications by classifying MPI tasks based on their logical program execution order...
Dong H. Ahn, Bronis R. de Supinski, Ignacio Laguna...
CAV
2004
Springer
151views Hardware» more  CAV 2004»
14 years 17 days ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...
PLDI
2011
ACM
12 years 11 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and veriļ¬cation tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...