Sciweavers

294 search results - page 8 / 59
» Relation between Semantic Completeness and Syntax Completene...
Sort
View
PLDI
2010
ACM
14 years 22 days ago
Line-up: a complete and automatic linearizability checker
Modular development of concurrent applications requires threadsafe components that behave correctly when called concurrently by multiple client threads. This paper focuses on line...
Sebastian Burckhardt, Chris Dern, Madanlal Musuvat...
KCAP
2005
ACM
14 years 1 months ago
Knowledge transformations between frame systems and RDB systems
For decades, researchers in knowledge representation (KR) have argued for and against various choices in KR formalisms, such as Rules, Frames, Semantic nets, and Formal logic. In ...
John H. Gennari, Peter Mork, Hao Li
PATAT
2000
Springer
89views Education» more  PATAT 2000»
13 years 11 months ago
A Language for Specifying Complete Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a nu...
Luís Paulo Reis, Eugenio Oliveira
POPL
2006
ACM
14 years 8 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
ENTCS
2008
79views more  ENTCS 2008»
13 years 7 months ago
Experimenting Formal Proofs of Petri Nets Refinements
Petri nets are a formalism for modelling and validating critical systems. Generally, the approach to specification starts from an abstract view of the system under study. Once val...
Christine Choppy, Micaela Mayero, Laure Petrucci