Sciweavers

3005 search results - page 257 / 601
» Logical Information Systems: from Taxonomies to Logics
Sort
View
CORR
2010
Springer
194views Education» more  CORR 2010»
15 years 4 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
151
Voted
LPNMR
1990
Springer
15 years 10 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
ICCAD
1996
IEEE
92views Hardware» more  ICCAD 1996»
15 years 11 months ago
Generation of BDDs from hardware algorithm descriptions
We propose a new method for generating BDDs from hardware algorithm descriptions written in a programming language. Our system can deal with control structures, such as conditiona...
Shin-ichi Minato
RE
2004
Springer
16 years 1 days ago
RETNA: From Requirements to Testing in a Natural Way
Most problems in building and refining a system can be traced back to errors in requirements. Poorly organized requirements, most often in natural language are among the major ca...
Ravishankar Boddu, Lan Guo, Supratik Mukhopadhyay,...
CF
2011
ACM
14 years 6 months ago
SIFT: a low-overhead dynamic information flow tracking architecture for SMT processors
Dynamic Information Flow Tracking (DIFT) is a powerful technique that can protect unmodified binaries from a broad range of vulnerabilities such as buffer overflow and code inj...
Meltem Ozsoy, Dmitry Ponomarev, Nael B. Abu-Ghazal...