Sciweavers

80 search results - page 2 / 16
» Relational queries over program traces
Sort
View
SPLC
2004
13 years 6 months ago
Automatic Generation of Program Families by Model Restrictions
We study the generative development of control programs for families of embedded devices. A software family is described by a single common model and restriction specifications for...
Andrzej Wesowski
CSIE
2009
IEEE
13 years 11 months ago
A Metamodel for Tracing Non-functional Requirements
The tendency for Non-Functional Requirements (NFRs) to have a wide-ranging impact on a software system, and the strong interdependencies and tradeoffs that exist between NFRs and ...
Mohamad Kassab, Olga Ormandjieva, Maya Daneva
APLAS
2007
ACM
13 years 9 months ago
A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...
Alwen Tiu
JSS
2007
120views more  JSS 2007»
13 years 4 months ago
The design and evaluation of path matching schemes on compressed control flow traces
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in com...
Yongjing Lin, Youtao Zhang, Rajiv Gupta
SIGMOD
2012
ACM
234views Database» more  SIGMOD 2012»
11 years 7 months ago
BloomUnit: declarative testing for distributed programs
We present BloomUnit, a testing framework for distributed programs written in the Bloom language. BloomUnit allows developers to write declarative test specifications that descri...
Peter Alvaro, Andrew Hutchinson, Neil Conway, Will...