Sciweavers

1397 search results - page 74 / 280
» On the Need for Practical Formal Methods
Sort
View
FORMATS
2006
Springer
14 years 20 days ago
Model Checking Timed Automata with Priorities Using DBM Subtraction
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
Alexandre David, John Håkansson, Kim Guldstr...
EUROCRYPT
2001
Springer
14 years 1 months ago
How Secure Are Elliptic Curves over Composite Extension Fields?
We compare the method of Weil descent for solving the ECDLP, over extensions fields of composite degree in characteristic two, against the standard method of parallelised Pollard ...
Nigel P. Smart
ACST
2006
13 years 10 months ago
Experimental study of hybrid-type distributed maximal constraint satisfaction algorithm
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
Masato Noto, Masahito Kurihara
ICFCA
2010
Springer
14 years 1 months ago
A Survey of Hybrid Representations of Concept Lattices in Conceptual Knowledge Processing
A feature of Formal Concept Analysis is the use of the line diagram of the concept lattice to visualize a conceptual space. The line diagram is a specialized form of Hasse diagram ...
Peter W. Eklund, Jean Villerd
CAV
2003
Springer
108views Hardware» more  CAV 2003»
14 years 2 months ago
Linear Invariant Generation Using Non-linear Constraint Solving
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
Michael Colón, Sriram Sankaranarayanan, Hen...