Sciweavers

2407 search results - page 323 / 482
» A Tool for Abstraction in Model Checking
Sort
View
SLP
1993
110views more  SLP 1993»
15 years 8 months ago
Logic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
D. Andre de Waal, John P. Gallagher
AAMAS
2007
Springer
15 years 7 months ago
An algebra for commitment protocols
Protocols enable unambiguous, smooth interactions among agents. Commitments among agents are a powerful means of developing protocols. Commitments enable flexible execution of pro...
Ashok U. Mallya, Munindar P. Singh
COMSIS
2010
15 years 4 months ago
A domain-specific language for defining static structure of database applications
Abstract. In this paper we present DOMMLite - an extensible domainspecific language (DSL) for static structure definition of databaseoriented applications. The model-driven enginee...
Igor Dejanovic, Gordana Milosavljevic, Branko Peri...
TCAD
2010
121views more  TCAD 2010»
15 years 1 months ago
Translation Validation of High-Level Synthesis
The growing complexity of systems and their implementation into silicon encourages designers to look for model designs at higher levels of abstraction and then incrementally build ...
Sudipta Kundu, Sorin Lerner, Rajesh K. Gupta
ECOOP
2009
Springer
16 years 7 months ago
Making Sense of Large Heaps
Abstract. It is common for large-scale Java applications to suffer memory problems, whether inefficient designs that impede scalability, or lifetime bugs such as leaks. Making sens...
Nick Mitchell, Edith Schonberg, Gary Sevitsky