Sciweavers

8828 search results - page 326 / 1766
» Formal methods in practice
Sort
View
DEXAW
2007
IEEE
138views Database» more  DEXAW 2007»
16 years 1 months ago
Machine Learning for Question Answering from Tabular Data
Question Answering (QA) systems automatically answer natural language questions in a human-like manner. One of the practical approaches to open domain QA consists in extracting fa...
Mahboob Alam Khalid, Valentin Jijkoun, Maarten de ...
MEMOCODE
2007
IEEE
16 years 1 months ago
Combining Multi-Valued Logics in SAT-based ATPG for Path Delay Faults
Due to the rapidly growing speed and the decreasing size of gates in modern chips, the probability of faults caused by the production process grows. Already small variations lead ...
Stephan Eggersglüß, Görschwin Fey,...
CCS
2007
ACM
16 years 28 days ago
Universally composable and forward-secure RFID authentication and authenticated key exchange
Recently, a universally composable framework for RFID authentication protocols providing availability, anonymity, and authenticity was proposed. In this paper we extend that frame...
Tri Van Le, Mike Burmester, Breno de Medeiros
IFM
2007
Springer
101views Formal Methods» more  IFM 2007»
16 years 27 days ago
Translating FSP into LOTOS and Networks of Automata
Many process calculi have been proposed since Robin Milner and Tony Hoare opened the way more than 25 years ago. Although they are based on the same kernel of operators, most of th...
Gwen Salaün, Jeff Kramer, Frédé...
CAV
2005
Springer
104views Hardware» more  CAV 2005»
16 years 8 days ago
Expand, Enlarge and Check... Made Efficient
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
Gilles Geeraerts, Jean-François Raskin, Lau...