Results 11 to 20 of about 46,991 (95)
Shared abstract data types: An algebraic methodology for their specification
, 1989 In this paper a methodology for specifying data in a transaction system is proposed. We present the outline of a style of shared data definition, by which it is possible to avoid the unnecessary constraints on concurrency usually imposed by traditional transaction management approaches. The used method is based on the definition of the data as abstract
Bondavalli A +3 more
openaire +4 more sources
On the enumeration of closures and environments with an application to random generation [PDF]
, 2019 Environments and closures are two of the main ingredients of evaluation in lambda-calculus. A closure is a pair consisting of a lambda-term and an environment, whereas an environment is a list of lambda-terms assigned to free variables.
Bendkowski, Maciej, Lescanne, Pierre
core +3 more sources
JMatch: Java plus Pattern Matching [PDF]
, 2002 The JMatch language extends Java with \emph{iterable abstract pattern matching}, pattern matching that is compatible with the data abstraction features of Java and makes iteration abstractions convenient.
Liu, Jed, Myers, Andrew C.
core
Formal Verification of Security Protocol Implementations: A Survey [PDF]
, 2014 Automated formal verification of security protocols has been mostly focused on analyzing high-level abstract models which, however, are significantly different from real protocol implementations written in programming languages.
A Bauer +27 more
core +3 more sources
Specifying Reusable Components
, 2010 Reusable software components need expressive specifications. This paper outlines a rigorous foundation to model-based contracts, a method to equip classes with strong contracts that support accurate design, implementation, and formal verification of ...
B. Meyer +8 more
core +3 more sources
Ten virtues of structured graphs [PDF]
, 2009 This paper extends the invited talk by the first author about the virtues of structured graphs. The motivation behind the talk and this paper relies on our experience on the development of ADR, a formal approach for the design of styleconformant ...
Bruni, Roberto, Lluch-Lafuente, Alberto
core +2 more sources
Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories
, 2017 Cyclic data structures, such as cyclic lists, in functional programming are tricky to handle because of their cyclicity. This paper presents an investigation of categorical, algebraic, and computational foundations of cyclic datatypes.
Hamana, Makoto
core +1 more source
A reification calculus for model-oriented software specification [PDF]
, 1990 This paper presents a transformational approach to the derivation of implementations from model-oriented specifications of abstract data types. The purpose of this research is to reduce the number of formal proofs required in model refinement ...
C. A. R. Hoare +11 more
core +2 more sources
The use of sequencing information in software specification for verification [PDF]
, 1983 Software requirements specifications, virtual machine definitions, and algorithmic design all place constraints on the sequence of operations that are permissible during a program's execution.
Osterweil, Leon J., Taylor, Richard N.
core +1 more source
, 2009 Let Q_0 denote the rational numbers expanded to a meadow by totalizing inversion such that 0^{-1}=0. Q_0 can be expanded by a total sign function s that extracts the sign of a rational number.
Bergstra, Jan A., Bethke, I.
core +2 more sources