Sciweavers

386 search results - page 51 / 78
» Debugging Logic Programs Using Specifications
Sort
View
IPL
2008
102views more  IPL 2008»
13 years 9 months ago
The connection between two ways of reasoning about partial functions
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
John S. Fitzgerald, Cliff B. Jones
FASE
2009
Springer
14 years 1 months ago
Certification of Smart-Card Applications in Common Criteria
This paper describes the certification of smart-card applications in the framework of Common Criteria. In this framework, a smart-card application is represented by a model of its...
Iman Narasamdya, Michaël Périn
JFP
2000
163views more  JFP 2000»
13 years 9 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini
AAAI
1994
13 years 11 months ago
Rule Based Updates on Simple Knowledge Bases
In this paper we consider updates that are specified as rules and consider simple knowledge bases consisting of ground atoms. We present a translation of the rule based update spe...
Chitta Baral
SIGSOFT
2005
ACM
14 years 10 months ago
Fluent temporal logic for discrete-time event-based models
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...