Sciweavers

175 search results - page 34 / 35
» Symbolic Model Checking for Asynchronous Boolean Programs
Sort
View
ENTCS
2007
105views more  ENTCS 2007»
13 years 6 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
TACAS
2005
Springer
124views Algorithms» more  TACAS 2005»
13 years 11 months ago
Localization and Register Sharing for Predicate Abstraction
ion Himanshu Jain1,2 , Franjo Ivanˇci´c1 , Aarti Gupta1 , and Malay K. Ganai1 1 NEC Laboratories America, Inc., 4 Independence Way, Princeton, NJ 08540 2 School of Computer Scien...
Himanshu Jain, Franjo Ivancic, Aarti Gupta, Malay ...
CAV
2010
Springer
214views Hardware» more  CAV 2010»
13 years 10 months ago
Learning Component Interfaces with May and Must Abstractions
elor Thesis: Demand Driven Abstraction Refinement • Advisor: Dr. Andrey Rybalchenko Kendriya Vidyalaya ONGC, Dehradun, Uttaranchal INDIA All India Senior Secondary Examination, ...
Rishabh Singh, Dimitra Giannakopoulou, Corina S. P...
SIGSOFT
2007
ACM
14 years 6 months ago
State space exploration using feedback constraint generation and Monte-Carlo sampling
The systematic exploration of the space of all the behaviours of a software system forms the basis of numerous approaches to verification. However, existing approaches face many c...
Sriram Sankaranarayanan, Richard M. Chang, Guofei ...
ICALP
2010
Springer
13 years 8 months ago
From Secrecy to Soundness: Efficient Verification via Secure Computation
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz