Sciweavers

PPDP
2015
Springer
8 years 3 months ago
ReactiveML, ten years later
Ten years ago we introduced ReactiveML, an extension of a strict ML language with synchronous parallelism `a la Esterel to program reactive applications. Our purpose was to demons...
Louis Mandel, Cédric Pasteur, Marc Pouzet
PPDP
2015
Springer
8 years 3 months ago
Declarative interpretations of session-based concurrency
Session-based concurrency is a type-based approach to the analysis of communication-intensive systems. Correct behavior in these systems may be specified in an operational or dec...
Mauricio Cano, Camilo Rueda, Hugo A. López,...
PPDP
2015
Springer
8 years 3 months ago
Lasp: a language for distributed, coordination-free programming
We propose Lasp, a new programming model designed to simplify large-scale distributed programming. Lasp combines ideas from deterministic dataflow programming together with con...
Christopher Meiklejohn, Peter Van Roy
ATVA
2015
Springer
23views Hardware» more  ATVA 2015»
8 years 3 months ago
ASSA-PBN: An Approximate Steady-State Analyser of Probabilistic Boolean Networks
We present ASSA-PBN, a tool for approximate steady-state analysis of large probabilistic Boolean networks (PBNs). ASSA-PBN contains a constructor, a simulator, and an analyser whic...
Andrzej Mizera, Jun Pang, Qixia Yuan
ATVA
2015
Springer
19views Hardware» more  ATVA 2015»
8 years 3 months ago
Severity Levels of Inconsistent Code
Inconsistent code detection is a variant of static analysis that detects statements that never occur on feasible executions. This includes code whose execution ultimately must lead...
Martin Schäf, Ashish Tiwari
ATVA
2015
Springer
25views Hardware» more  ATVA 2015»
8 years 3 months ago
Spanning the Spectrum from Safety to Liveness
Of special interest in formal verification are safety specifications, which assert that the system stays within some allowed region, in which nothing “bad” happens. Equivalen...
Rachel Faran, Orna Kupferman
ATVA
2015
Springer
37views Hardware» more  ATVA 2015»
8 years 3 months ago
Decidability of the Reachability for a Family of Linear Vector Fields
The reachability problem is one of the most important issues in the verification of hybrid systems. Computing the reachable sets of differential equations is difficult, although c...
Ting Gan, Mingshuai Chen, Liyun Dai, Bican Xia, Na...
ATVA
2015
Springer
25views Hardware» more  ATVA 2015»
8 years 3 months ago
Trace Diagnostics Using Temporal Implicants
Runtime verification and model checking are two important methods for assessing correctness of systems. In both techniques, detecting an error is witnessed by an execution that vi...
Thomas Ferrère, Oded Maler, Dejan Nickovic
ATVA
2015
Springer
24views Hardware» more  ATVA 2015»
8 years 3 months ago
Lattice-Based Semantics for Combinatorial Model Evolution
Combinatorial test design (CTD) is an effective test design technique, considered to be a testing best practice. CTD provides automatic test plan generation, but it requires a man...
Rachel Tzoref-Brill, Shahar Maoz
ATVA
2015
Springer
29views Hardware» more  ATVA 2015»
8 years 3 months ago
Effective Verification of Replicated Data Types Using Later Appearance Records (LAR)
Replicated data types store copies of identical data across multiple servers in a distributed system. For the replicas to satisfy strong eventual consistency, these data types sho...
Madhavan Mukund, Gautham Shenoy R., S. P. Suresh