Sciweavers

2067 search results - page 178 / 414
» Logics of propositional control
Sort
View
CODES
2007
IEEE
16 years 27 days ago
Secure FPGA circuits using controlled placement and routing
In current Field-Programmable-Logic Architecture (FPGA) design flows, it is very hard to control the routing of submodules. It is thus very hard to make an identical copy of an ex...
Pengyuan Yu, Patrick Schaumont
INAP
2001
Springer
15 years 11 months ago
Towards Reconciling Use Cases via Controlled Language and Graphical Models
Abstract. In requirements engineering use cases are employed to describe the ow of events and the occurrence of states in a future information system. Use cases consist of a set of...
Kathrin Böttger, Rolf Schwitter, Diego Moll&a...
CADE
2006
Springer
16 years 6 months ago
Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers
Propositional canonical Gentzen-type systems, introduced in [1], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Anna Zamansky, Arnon Avron
ICSE
2007
IEEE-ACM
16 years 6 months ago
Sequential Circuits for Relational Analysis
The Alloy tool-set has been gaining popularity as an alternative to traditional manual testing and checking for design correctness. Alloy uses a first-order relational logic for m...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
ICFP
2002
ACM
16 years 6 months ago
An expressive, scalable type theory for certified code
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
Karl Crary, Joseph Vanderwaart