Sciweavers

617 search results - page 68 / 124
» Using Formal Methods in a Retrospective Safety Case
Sort
View
AIL
2008
93views more  AIL 2008»
13 years 7 months ago
An ontology in OWL for legal case-based reasoning
In this paper, we present an ontology in OWL for Legal Case-based Reasoning. We outline some of the main motivations for providing an ontology in OWL, then discuss Legal Case-base...
Adam Zachary Wyner
CAV
2005
Springer
122views Hardware» more  CAV 2005»
14 years 1 months ago
Interpolant-Based Transition Relation Approximation
Abstract. In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, sof...
Ranjit Jhala, Kenneth L. McMillan
POPL
2010
ACM
14 years 5 months ago
Dependent types and program equivalence
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
Jianzhou Zhao, Limin Jia, Stephanie Weirich, Vilhe...
SIGCSE
2005
ACM
163views Education» more  SIGCSE 2005»
14 years 1 months ago
Using SeSFJava in teaching introductory network courses
Networking course projects are usually described by an informal specification and a collection of test cases. Students often misunderstand the specification or oversimplify it t...
Tamer Elsharnouby, A. Udaya Shankar
FORMATS
2007
Springer
14 years 1 months ago
Hypervolume Approximation in Timed Automata Model Checking
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
Víctor A. Braberman, Jorge Lucángeli...