Sciweavers

2713 search results - page 336 / 543
» Parameterized Tree Systems
Sort
View
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
15 years 10 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
SPRINGSIM
2007
15 years 7 months ago
Modeling and analysis of worm defense using stochastic activity networks
— Stochastic activity networks (SANs) are a widely used formalism for describing complex systems that have random behavior. Sophisticated software tools exist for the modeling an...
David M. Nicol, Steve Hanna, Frank Stratton, Willi...
CORR
2006
Springer
141views Education» more  CORR 2006»
15 years 6 months ago
Ideas by Statistical Mechanics (ISM)
Ideas by Statistical Mechanics (ISM) is a generic program to model evolution and propagation of ideas/patterns throughout populations subjected to endogenous and exogenous interac...
Lester Ingber
TAP
2008
Springer
93views Hardware» more  TAP 2008»
15 years 6 months ago
Pex-White Box Test Generation for .NET
Pex automatically produces a small test suite with high code coverage for a .NET program. To this end, Pex performs a systematic program analysis (using dynamic symbolic execution,...
Nikolai Tillmann, Jonathan de Halleux
CADE
2009
Springer
16 years 7 months ago
Beyond Dependency Graphs
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
Martin Korp, Aart Middeldorp