Sciweavers

923 search results - page 35 / 185
» Proving the value of formal methods
Sort
View
NSPW
1998
ACM
15 years 10 months ago
Meta Objects for Access Control: a Formal Model for Role-Based Principals
Object-based programming is becoming more and more popular and is currently conquering the world of distributed programming models. In object-based systems access control is often...
Thomas Riechmann, Franz J. Hauck
ATVA
2007
Springer
87views Hardware» more  ATVA 2007»
16 years 7 days ago
Latticed Simulation Relations and Games
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
Orna Kupferman, Yoad Lustig
CAV
2005
Springer
135views Hardware» more  CAV 2005»
15 years 11 months ago
Linear Ranking with Reachability
We present a complete method for synthesizing lexicographic linear ranking functions supported by inductive linear invariants for loops with linear guards and transitions. Proving ...
Aaron R. Bradley, Zohar Manna, Henny B. Sipma
ICCD
2004
IEEE
137views Hardware» more  ICCD 2004»
16 years 3 months ago
Comparative Study of Strategies for Formal Verification of High-Level Processors
Compared are different methods for evaluation of formulas expressing microprocessor correctness in the logic of Equality with Uninterpreted Functions and Memories (EUFM) by transl...
Miroslav N. Velev
MOC
2010
15 years 25 days ago
Entropy-satisfying relaxation method with large time-steps for Euler IBVPs
This paper could have been given the title: "How to positively and implicitly solve Euler equations using only linear scalar advections." The new relaxation method we pr...
Frédéric Coquel, Quang Long Nguyen, ...