Sciweavers

842 search results - page 102 / 169
» Linear logic
Sort
View
BIRTHDAY
1992
Springer
14 years 1 months ago
Single Tree Grammars
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various prope...
Sheila A. Greibach, Weiping Shi, Shai Simonson
TACAS
2005
Springer
98views Algorithms» more  TACAS 2005»
14 years 2 months ago
Monte Carlo Model Checking
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
Radu Grosu, Scott A. Smolka
SIGSOFT
2003
ACM
14 years 2 months ago
Fluent model checking for event-based systems
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
Dimitra Giannakopoulou, Jeff Magee
LICS
2005
IEEE
14 years 2 months ago
Certifying Compilation for a Language with Stack Allocation
This paper describes an assembly-language type system capable of ensuring memory safety in the presence of both heap and stack allocation. The type system uses linear logic and a ...
Limin Jia, Frances Spalding, David Walker, Neal Gl...
APAL
2008
90views more  APAL 2008»
13 years 9 months ago
On the unity of duality
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....
Noam Zeilberger