ACM Transactions on Programming Languages and Systems

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Traits
ACM Transactions on Programming Languages and Systems - Tập 28 Số 2 - Trang 331-388 - 2006
Sté́phane Ducasse, Oscar Nierstrasz, Nathanael Schärli, Roel Wuyts, Andrew P. Black
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ộ
Featherweight Java
ACM Transactions on Programming Languages and Systems - Tập 23 Số 3 - Trang 396-450 - 2001
Atsushi Igarashi, Benjamin C. Pierce, Philip Wadler
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ộ
Nontermination inference of logic programs
ACM Transactions on Programming Languages and Systems - Tập 28 Số 2 - Trang 256-289 - 2006
Étienne Payet, Fred Mesnard
We present a static analysis technique for nontermination inference of logic programs. Our framework relies on an extension of the subsumption test, where some specific argument positions can be instantiated while others are generalized. We give syntactic criteria to statically identify such argument positions from the text of a program. Atomic left looping queries are generated bottom-up ...... hiện toàn bộ
Compiling language definitions
ACM Transactions on Programming Languages and Systems - Tập 24 Số 4 - Trang 334-368 - 2002
Mark van den Brand, Jan Heering, Paul Klint, P.A.S. Olivier
The 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ộ
The temporal logic of actions
ACM Transactions on Programming Languages and Systems - Tập 16 Số 3 - Trang 872-923 - 1994
Leslie Lamport
The 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ộ
Designing families of data types using exemplars
ACM Transactions on Programming Languages and Systems - Tập 11 Số 2 - Trang 212-248 - 1989
Wilf R. LaLonde
Designing data types in isolation is fundamentally different from designing them for integration into communities of data types, especially when inheritance is a fundamental issue. Moreover, we can distinguish between the design of families—integrated types that are variations of each other—and more general communities where totally different but cohesive collections of types support speci...... hiện toàn bộ
The pattern calculus
ACM Transactions on Programming Languages and Systems - Tập 26 Số 6 - Trang 911-937 - 2004
C. Barry Jay
There 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ộ
A Deductive Approach to Program Synthesis
ACM Transactions on Programming Languages and Systems - Tập 2 Số 1 - Trang 90-121 - 1980
Zohar Manna, Richard Waldinger
Program 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ộ
Model checking and abstraction
ACM Transactions on Programming Languages and Systems - Tập 16 Số 5 - Trang 1512-1542 - 1994
Edmund M. Clarke, Orna Grumberg, David E. Long
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ộ
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems - Tập 19 Số 2 - Trang 253-291 - 1997
Dennis Dams, Rob Gerth, Orna Grumberg
Tổng số: 12   
  • 1
  • 2