scispace - formally typeset
Book ChapterDOI

On Observing Nondeterminism and Concurrency

Reads0
Chats0
About
This article is published in International Colloquium on Automata, Languages and Programming.The article was published on 1980-07-14. It has received 4755 citations till now. The article focuses on the topics: Concurrency.

read more

Citations
More filters
Journal ArticleDOI

MolProbity: all-atom contacts and structure validation for proteins and nucleic acids

TL;DR: MolProbity is a general-purpose web server offering quality validation for 3D structures of proteins, nucleic acids and complexes that provides detailed all-atom contact analysis of any steric problems within the molecules as well as updated dihedral-angle diagnostics.
Book ChapterDOI

A Temporal Logic of Nested Calls and Returns

TL;DR: This work introduces a temporal logic of calls and returns (CaRet) for specification and algorithmic verification of correctness requirements of structured programs and presents a tableau construction that reduces the model checking problem to the emptiness problem for a Buchi pushdown system.
Journal ArticleDOI

Automatic verification of finite-state concurrent systems using temporal logic specifications

TL;DR: It is argued that this technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite-state concurrent systems.
Book ChapterDOI

Evaluating 2-DNF formulas on ciphertexts

TL;DR: A homomorphic public key encryption scheme that allows the public evaluation of ψ given an encryption of the variables x1,...,xn and can evaluate quadratic multi-variate polynomials on ciphertexts provided the resulting value falls within a small set.
Book ChapterDOI

A Tutorial on UPPAAL

TL;DR: This is a tutorial paper on the tool Uppaal to be a short introduction on the flavor of timed automata implemented in the tool, to present its interface, and to explain how to use the tool.
References
More filters
Proceedings ArticleDOI

The temporal logic of programs

Amir Pnueli
TL;DR: A unified approach to program verification is suggested, which applies to both sequential and parallel programs, and the main proof method is that of temporal reasoning in which the time dependence of events is the basic concept.
Book

Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

TL;DR: Treats various kinds of languages, beginning with the pure-lambda-calculus and progressing through languages with states, commands, jumps, and assignments.
Journal ArticleDOI

A Powerdomain Construction

TL;DR: A powerdomain construction is developed, which is analogous to the powerset construction and also fits in with the usual sum, product and exponentiation constructions on domains, and a restricted class of algebraic inductive partial orders is found which is closed under this construction.
Journal ArticleDOI

Semantical considerations on floyd-hoare logic

TL;DR: An appropriate axiom system is given which is complete for loop-free programs and also puts conventional predicate calculus in a different light by lumping quantifiers with non-logical assignments rather than treating them as logical concepts.