Journal of the ACM

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:  
Some Recursively Unsolvable Problems in ALGOL-Like Languages
Journal of the ACM - Tập 10 Số 1 - Trang 29-47 - 1963
Seymour Ginsburg, Gene F. Rose
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
Journal of the ACM - Tập 12 Số 1 - Trang 42-52 - 1965
Sheila A. Greibach
A really temporal logic
Journal of the ACM - Tập 41 Số 1 - Trang 181-203 - 1994
Rajeev Alur, Thomas A. Henzinger
We introduce a temporal logic for the specification of real-time systems. Our logic, TPTL, employs a novel quantifier construct for referencing time: the freeze quantifier binds a variable to the time of the local temporal context. TPTL is both a natural language for specification and a su...... hiện toàn bộ
Alternation
Journal of the ACM - Tập 28 Số 1 - Trang 114-133 - 1981
Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer
Analyzing security protocols with secrecy types and logic programs
Journal of the ACM - Tập 52 Số 1 - Trang 102-146 - 2005
Martı́n Abadi, Bruno Blanchet
We study and further develop two language-based techniques for analyzing security protocols. One is based on a typed process calculus; the other, on untyped logic programs. Both focus on secrecy properties. We contribute to these two techniques, in particular by extending the former with a flexible, generic treatment of many cryptographic operations. We also establish an equivalence betwee...... hiện toàn bộ
Interval arithmetic
Journal of the ACM - Tập 48 Số 5 - Trang 1038-1068 - 2001
Timothy J. Hickey, Qun Ju, M. H. van Emden
We start with a mathematical definition of a real interval as a closed, connected set of reals. Interval arithmetic operations (addition, subtraction, multiplication, and division) are likewise defined mathematically and we provide algorithms for computing these operations assuming exact real arithmetic. Next, we define interval arithmetic operations on intervals with IEEE 754 floating poi...... hiện toàn bộ
Alternating-time temporal logic
Journal of the ACM - Tập 49 Số 5 - Trang 672-713 - 2002
Rajeev Alur, Thomas A. Henzinger, Orna Kupferman
Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by the execution of a system; branching-time temporal logic allows explicit existential and universal quantification over all paths. We...... hiện toàn bộ
New Methods in Automatic Extracting
Journal of the ACM - Tập 16 Số 2 - Trang 264-285 - 1969
H. P. Edmundson
This paper describes new methods of automatically extracting documents for screening purposes, i.e. the computer selection of sentences having the greatest potential for conveying to the reader the substance of the document. While previous work has focused on one component of sentence significance, namely, the presence of high-frequency content words (key words), the methods described here...... hiện toàn bộ
Connected Component Labeling Using Quadtrees
Journal of the ACM - Tập 28 Số 3 - Trang 487-501 - 1981
Hanan Samet
Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
Journal of the ACM - Tập 48 Số 2 - Trang 274-296 - 2001
Kamal Jain, Vijay V. Vazirani
We present approximation algorithms for the metric uncapacitated facility location problem and the metric k -median problem achieving guarantees of 3 and 6 respectively. The distinguishing feature of our algorithms is their low running time: O(m log m<...... hiện toàn bộ
Tổng số: 77   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 8