Sciweavers

2364 search results - page 411 / 473
» An Engine for Computing Well-Founded Models
Sort
View
FOSSACS
2005
Springer
15 years 9 months ago
Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
Samy Abbes, Albert Benveniste
ICFEM
2005
Springer
15 years 9 months ago
An Evidential Tool Bus
Abstract. Theorem provers, model checkers, static analyzers, test generators. . . all of these and many other kinds of formal methods tools can contribute to the analysis and devel...
John M. Rushby
LCTRTS
2004
Springer
15 years 9 months ago
Spinach: a liberty-based simulator for programmable network interface architectures
This paper presents Spinach, a new simulator toolset specifically designed to target programmable network interface architectures. Spinach models both system components that are ...
Paul Willmann, Michael Brogioli, Vijay S. Pai
CICLING
2003
Springer
15 years 9 months ago
Total Lexicalism and GASGrammars: A Direct Way to Semantics
A new sort of generative grammar (Sec2) will be demonstrated which is more radically “lexicalist” than any earlier one (Sec1). It is a modified Unification Categorial Gramma...
Gábor Alberti, Katalin Balogh, Judit Kleibe...
138
Voted
FOSSACS
2003
Springer
15 years 9 months ago
A Game Semantics for Generic Polymorphism
Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe th...
Samson Abramsky, Radha Jagadeesan