Sciweavers

1763 search results - page 86 / 353
» A Formalization of Polytime Functions
Sort
View
WADT
1998
Springer
15 years 2 months ago
Moving Specification Structures Between Logical Systems
Abstract. The conditions under which a formal system for reasoning about structural specifications, built over one logical system could be reused for reasoning about structured spe...
Tomasz Borzyszkowski
AIL
1998
107views more  AIL 1998»
14 years 9 months ago
A Comparison of Four Ontologies for the Design of Legal Knowledge Systems
There is a growing interest in how people conceptualise the legal domain for the purpose of legal knowledge systems. In this paper we discuss four such conceptualisations (referred...
Pepijn R. S. Visser, Trevor J. M. Bench-Capon
SAS
2009
Springer
212views Formal Methods» more  SAS 2009»
15 years 10 months ago
The Causal Graph Revisited for Directed Model Checking
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
Martin Wehrle, Malte Helmert
SAS
2009
Springer
148views Formal Methods» more  SAS 2009»
15 years 10 months ago
Abstract Interpretation from a Topological Perspective
Interpretation from a Topological Perspective David A. Schmidt Kansas State University, Manhattan, Kansas, USA Abstract. Topology is the study of property sets (open sets) and cont...
David A. Schmidt
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 2 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig