ACM Transactions on Programming Languages and Systems
SCOPUS (1979-2023)SCIE-ISI
0164-0925
1558-4593
Mỹ
Cơ quản chủ quản: Association for Computing Machinery (ACM) , ASSOC COMPUTING MACHINERY
Lĩnh vực:
Software
Các bài báo tiêu biểu
The temporal logic of actionsThe temporal logic of actions (TLA) is a logic for specifying and reasoning about concurrent systems. Systems and their properties are represented in the same logic, so the assertion that a system meets its specification and the assertion that one system implements another are both expressed by logical implication. TLA is very simple; its syntax and complete formal semantics are summarized... ... hiện toàn bộ
Tập 16 Số 3 - Trang 872-923 - 1994
Model checking and abstraction
We describe a method for using abstraction to reduce the complexity of temporal-logic model checking. Using techniques similar to those involved in abstract interpretation, we construct an abstract model of a program without ever examining the corresponding unabstracted model. We show how this abstract model can be used to verify properties of the original program. We have imp... ... hiện toàn bộ
Tập 16 Số 5 - Trang 1512-1542 - 1994
Featherweight Java
Several recent studies have introduced lightweight versions of Java: reduced languages in which complex features like threads and reflection are dropped to enable rigorous arguments about key properties such as type safety. We carry this process a step further, omitting almost all features of the full language (including interfaces and even assignment) to obtain a small calcul... ... hiện toàn bộ
Tập 23 Số 3 - Trang 396-450 - 2001
The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory
Tập 3 Số 4 - Trang 353-387 - 1981
A Deductive Approach to Program SynthesisProgram synthesis is the systematic derivation of a program from a given specification. A deductive approach to program synthesis is presented for the construction of recursive programs. This approach regards program synthesis as a theorem-proving task and relies on a theorem-proving method that combines the features of transformation rules, unification, and mathematical induction within a... ... hiện toàn bộ
Tập 2 Số 1 - Trang 90-121 - 1980
Traits
Inheritance is well-known and accepted as a mechanism for reuse in object-oriented languages. Unfortunately, due to the coarse granularity of inheritance, it may be difficult to decompose an application into an optimal class hierarchy that maximizes software reuse. Existing schemes based on single inheritance, multiple inheritance, or mixins, all pose numerous problems for reu... ... hiện toàn bộ
Tập 28 Số 2 - Trang 331-388 - 2006
Compiling language definitionsThe ASF+SDF Meta-Environment is an interactive language development environment whose main application areas are definition and implementation of domain-specific languages, generation of program analysis and transformation tools, and production of software renovation tools. It uses conditional rewrite rules to define the dynamic semantics and other tool-oriented aspects of languages, so th... ... hiện toàn bộ
Tập 24 Số 4 - Trang 334-368 - 2002
The pattern calculusThere is a significant class of operations such as mapping that are common to all data structures. The goal of generic programming is to support these operations on arbitrary data types without having to recode for each new type. The pattern calculus and combinatory type system reach this goal by representing each data structure as a combination of names and a finite set of constructors. T... ... hiện toàn bộ
Tập 26 Số 6 - Trang 911-937 - 2004