Sciweavers

101 search results - page 15 / 21
» Maintaining constraints expressed as formulas in collaborati...
Sort
View
LCTRTS
2007
Springer
14 years 1 months ago
Generalizing parametric timing analysis
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...
Joel Coffman, Christopher A. Healy, Frank Mueller,...
ICLP
2007
Springer
13 years 11 months ago
Web Sites Verification: An Abductive Logic Programming Tool
We present the CIFFWEB system, an innovative tool for the verification of web sites, relying upon abductive logic programming. The system allows the user to define rules that a web...
Paolo Mancarella, Giacomo Terreni, Francesca Toni
KBSE
2005
IEEE
14 years 1 months ago
Learning to verify branching time properties
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
Abhay Vardhan, Mahesh Viswanathan
JCS
2002
115views more  JCS 2002»
13 years 7 months ago
Panoptis: Intrusion Detection Using a Domain-Specific Language
We describe the use of a domain-specific language (DSL) for expressing critical design values and constraints in an intrusion detection application. Through the use of this specia...
Diomidis Spinellis, Dimitris Gritzalis
APLAS
2004
ACM
14 years 1 months ago
Network Fusion
Modular programming enjoys many well-known advantages: readability, maintainability, separate development and compilation. However, the composition of modular units (components) s...
Pascal Fradet, Stéphane Hong Tuan Ha