Sciweavers

3573 search results - page 358 / 715
» Reasoning about Codata
Sort
View
SIGSOFT
1994
ACM
15 years 9 months ago
Foundations of Software Testing: Dependability Theory
Testing is potentially the best grounded part of software engineering, since it deals with the well defined situation of a fixed program and a test (a finite collection of input v...
Richard G. Hamlet
LILOG
1989
15 years 9 months ago
Order Sorted Predicate Logic
We propose a theory for reasoning about actions based on order-sorted predicate logic where one can consider an elaborate taxonomy of objects. We are interested in the projection ...
Arnold Oberschelp
106
Voted
VLDB
1990
ACM
91views Database» more  VLDB 1990»
15 years 9 months ago
An Incremental Join Attachment for Starburst
ABSTRACT - In this paperwe describe the design, implementation, and performance of an incremental join facility that has been added as an extension to the Starburst extensible DBMS...
Michael J. Carey, Eugene J. Shekita, George Lapis,...
173
Voted
AGTIVE
2007
Springer
15 years 9 months ago
Specifying Domain-Specific Refactorings for AndroMDA Based on Graph Transformation
Abstract. Applying refactoring in a model-driven software engineering context raises many new challenges that need to be addressed. In this paper, we consider model-driven software...
Gabriele Taentzer, Dirk Müller 0002, Tom Mens
146
Voted
ATAL
2007
Springer
15 years 9 months ago
A grounded specification language for agent programs
This paper studies the relation between agent specification and agent programming languages. In particular, it shows that an agent programming language obeys some desirable proper...
Mehdi Dastani, M. Birna van Riemsdijk, John-Jules ...