Sciweavers

210 search results - page 30 / 42
» Definability and automorphisms in abstract logics
Sort
View
LPNMR
1990
Springer
13 years 11 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
AGP
1999
IEEE
14 years 8 hour ago
Widening Sharing
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
TCS
2002
13 years 7 months ago
Set-sharing is redundant for pair-sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
FDL
2007
IEEE
13 years 11 months ago
Towards Assertion Based Verification of Analog and Mixed Signal Designs Using PSL
Abstract-- Analog and Mixed Signal (AMS) designs are important integrated systems that link digital circuits to the analog world. Following the success of PSL verification methodol...
Ghiath Al Sammane, Mohamed H. Zaki, Zhi Jie Dong, ...
UML
2001
Springer
14 years 3 days ago
UML Support for Designing Software Systems as a Composition of Design Patterns
Much of the research work on design patterns has primarily focused on discovering and documenting patterns. Design patterns promise early reuse benefits at the design stage. To rea...
Sherif M. Yacoub, Hany H. Ammar