|
Showing 1 - 4 of
4 matches in All Departments
This book constitutes the refereed proceedings of the 6th
International Workshop on Reachability Problems, RP 2012, held in
Bordeaux, France, in September, 2012. The 8 revised full papers
presented together with 4 invited talks were carefully reviewed and
selected from 15 submissions. The papers present current research
and original contributions related to reachability problems in
different computational models and systems such as algebraic
structures, computational models, hybrid systems, logic and
verification. Reachability is a fundamental problem that appears in
several different contexts: finite- and infinite-state concurrent
systems, computational models like cellular automata and Petri
nets, decision procedures for classical, modal and temporal logic,
program analysis, discrete and continuous systems, time critical
systems, and open systems modeled as games.
This book constitutes the refereed proceedings of the 13th International Conference on Computer Aided Verification, CAV 2001, held in Paris, France in July 2001.The 33 revised full papers presented were carefully reviewed and selected from 106 regular paper submissions; also included are 13 reviewed tool presentations selected from 27 submissions. The book offers topical sections on model checking and theorem proving, automata techniques, verification core technology, BDD and decision trees, abstraction and refinement, combinations, infinite state systems, temporal logics and verification, microprocessor verification and cache coherence, SAT and applications, and timed automata.
This volume contains the proceedings of the tenth annual Symposium
on Theoretical Aspects of Computer Science (STACS '93), held in
W}rzburg, February 25-27, 1993. The STACS symposia are held
alternately in Germany and France, and organized jointly by the
Special Interest Group for Theoretical Computer Science of the
Gesellschaft f}r Informatik (GI) and theSpecial Interest Group for
Applied Mathematics of the Association Francaise des Sciences et
Technologies de l'Information et des Syst mes (afcet). The volume
includes the three invited talks which opened the three days of the
symposium: "Causal and distributed semantics for concurrent
processes" (I. Castellani), "Parallel architectures: design and
efficient use" (B. Monien et al.), and "Transparent proofs" (L.
Babai). The selection of contributed papers is organized into parts
on: computational complexity, logic in computer science, efficient
algorithms, parallel and distributed computation, language theory,
computational geometry, automata theory, semantics and logic of
programming languages, automata theory and logic, circuit
complexity, omega-automata, non-classical complexity, learning
theory and cryptography, and systems.
This volume gives the proceedings of the ninth Symposium on
Theoretical Aspects of Computer Science (STACS). This annual
symposium is held alternately in France and Germany and is
organized jointly by the Special Interest Group for Fundamental
Computer Science of the Association Francaise des Sciences et
Technologies de l'Information et des Syst mes (AFCET) and the
Special Interest Group for Theoretical Computer Science of the
Gesellschaft f}r Informatik (GI). The volume includes three invited
lectures and sections on parallel algorithms, logic and semantics,
computational geometry, automata and languages, structural
complexity, computational geometry and learning theory, complexity
and communication, distributed systems, complexity, algorithms,
cryptography, VLSI, words and rewriting, and systems.
|
|