Home     Top: Theory: Formal Languages    [Computational Complexity   Formal Languages   Logic   Quantum Computing   Theorem Proving]

Change ordering:   Authority   Hubs (tutorials)   Date   Expected authority       Show abstracts
Ordered by the expected number of citations based on the year of publication

This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.

2171.4   The Syntax Definition Formalism SDF - Reference Manual - Heering, Hendriks, Klint, Rekers (2001)   (Correct)
508.6   A Theory of Timed Automata - Alur, Dill (1994)   (Correct)
472.4   Formal Methods: State of the Art and Future Directions - Clarke, Wing (1996)   (Correct)
442.6   The Well-Founded Semantics for General Logic Programs - Van Gelder, Ross, Schlipf (1991)   (Correct)
340.7   Domain Theory - Abramsky, Jung (1994)   (Correct)
320.9   Logical Foundations of Object-Oriented and Frame-Based Languages - Kifer, Lausen, Wu (1990)   (Correct)
279.0   A Framework for Defining Logics - Harper, Honsell, Plotkin (1987)   (Correct)
272.7   Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, Wilhelm (1999)   (Correct)
268.0   Radiosity and realistic image synthesis - Cohen, Wallace (1993)   (Correct)
267.0   Dynamic Logic - Harel, Kozen, Tiuryn (1984)   (Correct)
251.0   A Formal Basis for Architectural Connection - Allen, Garlan (1997)   (Correct)
234.7   A Modal Analysis of Staged Computation - Davies, Pfenning (1996)   (Correct)
200.0   Super Logic Programs - Brass, Przymusinski (2000)   (Correct)
200.0   Linearity and the Pi-Calculus - Kobayashi, Pierce, Turner (1996)   (Correct)
197.5   Exploiting Style in Architectural Design Environments - Garlan, Allen, Ockerbloom (1994)   (Correct)
165.4   A Needed Narrowing Strategy - Antoy, Echahed, Hanus (1994)   (Correct)
162.3   Temporal Query Languages: a Survey - Chomicki (1995)   (Correct)
150.6   On Unifying Some Cryptographic Protocol Logics - Syverson, van Oorschot (1994)   (Correct)
144.9   Relational Expressive Power of Constraint Query Languages - Benedikt, Dong, Libkin, Wong (1995)   (Correct)
144.9   Telos: Representing Knowledge About Information Systems - Mylopoulos, Borgida, Jarke.. (1990)   (Correct)
142.8   Processor Verification Using Efficient Reductions of the Logic of.. - Bryant, German, Velev (2001)   (Correct)
138.2   A Calculus for Access Control in Distributed Systems - Abadi, Burrows, Lampson, Plotkin (1991)   (Correct)
136.3   Event-Clock Automata: A Determinizable Class of Timed Automata - Alur, Fix, Henzinger (1999)   (Correct)
134.4   The Syntax Definition Formalism SDF - Reference Manual - - Heering, Hendriks, Klint, Rekers (1992)   (Correct)
131.9   Multiprocessor and Distributed System Design: The Integration of.. - Gotz, Herzog, Rettelbach (1993)   (Correct)
128.5   Composition and Integrity Preservation of Secure Reactive Systems - Pfitzmann, Waidner (2000)   (Correct)
128.5   A Metalanguage for Programming with Bound Names Modulo Renaming - Pitts, Gabbay (2000)   (Correct)
127.6   Tree-Adjoining Grammars - Joshi, Schabes (1997)   (Correct)
127.5   On the synthesis of strategies in infinite games - Thomas (1995)   (Correct)
120.5   What Every Computer Scientist Should Know About Floating Point.. - Goldberg (1991)   (Correct)
120.0   Enabling knowledge representation on the Web by extending RDF Schema - Broekstra, Klein, Decker, Fensel.. (2002)   (Correct)
115.9   How to Declare an Imperative - Wadler (1995)   (Correct)
114.2   Learning DFA from Simple Examples - Parekh, Honavar (2001)   (Correct)
110.1   A Polymorphic Record Calculus and Its Compilation - Ohori (1995)   (Correct)
108.5   Managing Inconsistent Specifications: Reasoning, Analysis, and Action - Hunter, Nuseibeh (1998)   (Correct)
106.3   Two-dimensional languages - Giammarresi, Restivo (1997)   (Correct)
104.3   Asymptotic Enumeration Methods - Odlyzko (1996)   (Correct)
102.1   The Expression Of Graph Properties And Graph Transformations In.. - Courcelle (1997)   (Correct)
101.2   Spatial Reasoning with Propositional Logics - Bennett (1994)   (Correct)
100.0   Verification on Infinite Structures - Burkart, Caucal, Moller, Steffen (2000)   (Correct)
100.0   Typed Memory Management via Static Capabilities - Walker, Crary, Morrisett (2000)   (Correct)
98.7   Petri Net Algorithms in the Theory of Matrix Grammars - Hauschildt, Jantzen (1994)   (Correct)
98.5   Mellin Transforms And Asymptotics: Harmonic Sums - Flajolet, Gourdon, Dumas (1995)   (Correct)
98.5   A Schema Theorem for Context-Free Grammars - Whigham (1995)   (Correct)
97.1   Jedi: Extracting and Synthesizing Information from the Web - Huck, Fankhauser, Aberer, Neuhold (1998)   (Correct)
96.2   Anytime Deduction for Probabilistic Logic - Frisch (1994)   (Correct)
89.3   DNA computing: arrival of biological mathematics - Kari (1997)   (Correct)
85.7   Logics for Hybrid Systems - Davoren, Nerode (2000)   (Correct)
85.7   The KEY Approach: Integrating Object Oriented Design and Formal.. - Ahrendt, Baar, Beckert, Giese.. (2000)   (Correct)
85.1   Combinatorics of words - Choffrut, Karhumäki (1997)   (Correct)
84.0   Extraction of Rules from Discrete-Time Recurrent Neural Networks - Omlin, Giles (1996)   (Correct)
82.4   The Complexity of Logic-Based Abduction - Eiter, Gottlob (1993)   (Correct)
81.8   Regular Languages are Testable with a Constant Number of Queries - Alon, Krivelevich, Newman, Szegedy (1999)   (Correct)
80.8   Partial Commutation and Traces - Diekert, Métivier (1997)   (Correct)
78.3   Methods and Rules - Serge Abiteboul Georg (1993)   (Correct)
78.2   Constructing Deterministic Finite-State Automata in Recurrent Neural.. - Omlin, Giles (1996)   (Correct)
78.2   Report from the NSF Workshop on Workflow and Process Automation in.. - Sheth, Georgakopoulos, Joosten.. (1996)   (Correct)
76.5   From Algol to Polymorphic Linear Lambda-calculus - O'Hearn, Reynolds (1997)   (Correct)
76.5   Forcing Behavioral Subtyping Through Specification Inheritance - Dhara, Leavens (1997)   (Correct)
73.5   Parsing English with a Link Grammar - Sleator, Temperley (1991)   (Correct)
72.7   MobiS: A Specification Language for Mobile Systems - Mascolo (1999)   (Correct)
72.3   A Reflection on Call-by-Value - Sabry, Wadler (1997)   (Correct)
71.4   Formally Modeling UML And Its Evolution: A Holistic Approach - Alvarez, Alemán (2000)   (Correct)
71.4   Abduction And Induction. Essays On Their Relation And Integration.. - Flach, Kakas (2000)   (Correct)
71.4   Syntactic Accidents in Program Analysis: On the Impact of the CPS.. - Damian, Danvy (2000)   (Correct)
71.4   Formal And Natural Language Generation In The Mercury Conversational.. - Seneff, Polifroni (2000)   (Correct)
71.4   Argument-based Applications to Knowledge Engineering - Daniela Carbogim David (2000)   (Correct)
71.4   On Knowledge-Based Programming with Sensing in the Situation Calculus - Reiter (2000)   (Correct)
69.5   Speech Recognition by Composition of Weighted Finite Automata - Pereira, Riley (1996)   (Correct)
68.5   Modular Domain Specific Languages and Tools - Hudak (1998)   (Correct)
66.1   Object-Preserving Class Transformations - Bergstein (1991)   (Correct)
65.0   Modelling Concurrency with Partial Orders - Pratt (1986)   (Correct)
63.8   Classification Of Research Efforts In Requirements Engineering - Zave (1997)   (Correct)
63.7   Probabilistic predicate transformers - Morgan, McIver, Seidel (1995)   (Correct)
62.8   The Marriage of Effects and Monads - Wadler, Thiemann (1998)   (Correct)
60.8   The Computational Analysis Of The Syntax And Interpretation Of "Free" .. - Hoffman (1995)   (Correct)
57.9   Closure Analysis in Constraint Form - Palsberg (1995)   (Correct)
57.7   Process And Policy: Resource-Bounded Non-Demonstrative Reasoning - Loui (1993)   (Correct)
57.1   Dynamic Argument Systems: A Formal Model of Argumentation Processes.. - Brewka (2000)   (Correct)
57.1   Genesis-II: A Versatile System For Language Generation In.. - Baptist, Seneff (2000)   (Correct)
57.1   Increasing Visualization and Interaction in the Automata Theory Course - Hung, Rodger (2000)   (Correct)
56.7   TIGUKAT: A Uniform Behavioral Objectbase Management System - Peters (1994)   (Correct)
55.3   Specification-based Testing of Reactive Software: A Case Study in.. - Jagadeesan, Porter, Puchol, Ramming, .. (1997)   (Correct)
55.3   Precise Flow-Insensitive May-Alias Analysis is NP-Hard - Horwitz (1997)   (Correct)
55.0   Regularity of Splicing Languages - Pixton (1995)   (Correct)
52.1   DNA Computing Based on Splicing: The Existence of Universal Computers - Freund, Kari, al. (1995)   (Correct)
52.1   Managing Inconsistent Specifications: Reasoning, Analysis and Action - Hunter (1995)   (Correct)
51.5   An Algorithm for Approximate Tandem Repeats - Landau, Schmidt, Sokol (1993)   (Correct)
51.0   Context-Free Languages and Push-Down Automata - Autebert, Berstel, Boasson (1997)   (Correct)
51.0   DECLARE: A Prototype Declarative Proof System for Higher Order Logic - Syme (1997)   (Correct)
49.3   Reasoning about Knowledge and Probability - Fagin, Halpern (1994)   (Correct)
49.2   Ontologies: Principles, Methods and Applications - Uschold, Grüninger (1996)   (Correct)
47.4   Theories Underlying Requirements Engineering: An Overview of NATURE.. - Jarke, Bubenko, Rolland, Sutcliffe.. (1993)   (Correct)
47.4   Continuation-Based Partial Evaluation - Lawall, Danvy (1993)   (Correct)
46.9   Membership for Limited ET0L Languages Is Not Decidable - Fernau (1994)   (Correct)
46.8   Length Considerations in Context-free Languages - Raz (1997)   (Correct)
46.3   Plausibility Measures and Default Reasoning - Friedman (1996)   (Correct)
45.7   Interconvertibility of Set Constraints and Context-Free Language.. - Melski, Reps (1998)   (Correct)
45.7   Transforming the Theorem Prover into a Digital Design Tool: From.. - Hardin, Wilding, Greve (1998)   (Correct)
45.4   Graph Transformation Units And Modules - Kreowski, Kuske (1999)   (Correct)
45.4   Logics with Aggregate Operators - Hella, Libkin, Nurmonen, Wong (1999)   (Correct)
44.4   A Comparison of Languages which Operationalize and Formalise KADS.. - Fensel, van Harmelen (1994)   (Correct)
43.4   Analysis of Dynamical Recognizers - Blair, Pollack (1996)   (Correct)
43.2   Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform.. - Mitchell (1993)   (Correct)
43.1   A Multiple-Method Knowledge-Acquisition Shell for the Automatic.. - Angel Puerta John (1992)   (Correct)
42.8   A Unifying Approach to HTML Wrapper Representation and Learning - Grieser, Jantke, Lange, Thomas (2000)   (Correct)
42.5   Controlling Generalisation and Polyvariance in Partial Deduction of.. - Leuschel, Martens, De Schreye (1997)   (Correct)
42.5   Compositional Semantics for a Language of Imperfect Information - Hodges (1997)   (Correct)
41.9   Aligning A Parallel English-Chinese Corpus Statistically With Lexical .. - Wu (1994)   (Correct)
41.3   Metalogical Frameworks - Basin, Constable (1992)   (Correct)
40.5   Coordination mechanisms: Towards a conceptual foundation of CSCW.. - Schmidt, Simone (1996)   (Correct)
40.5   Visual Models of Plants Interacting with Their Environment - Mech, Prusinkiewicz (1996)   (Correct)
40.5   Towards a Methodology for Building Ontologies - Uschold, King (1995)   (Correct)
40.0   Elemental Design Patterns - A Link Between Architecture and Object.. - Smith, Stotts (2002)   (Correct)
40.0   From Checking to Inference via Driving and Dag Grammars - Secher, Sørensen (2002)   (Correct)
40.0   Termination in Language-Based Systems - Algis Rudys And (2002)   (Correct)
40.0   Concurrency in Computational Networks - Stuijk (2002)   (Correct)
40.0   Maximal Introspection of Agents - Bolander (2002)   (Correct)
39.9   Knowledge Engineering: Principles and Methods - Studer, Benjamins, Fensel (1998)   (Correct)
39.9   A Mechanism for Establishing Policies for Electronic Commerce - Minsky, Ungureanu (1998)   (Correct)
37.6   A polynomial-time algorithm for deciding bisimulation equivalence of.. - Hirshfeld, Jerrum, Moller (1996)   (Correct)
37.1   CPS Transformation after Strictness Analysis - Danvy, Hatcliff (1993)   (Correct)
36.7   Action Logic and Pure Induction - Pratt (1991)   (Correct)
36.7   Handling Conflict Between Domain Descriptions With Computer-Supported .. - Easterbrook (1991)   (Correct)
35.2   The Pan Language-Based Editing System - Ballance, Graham, Vanter (1991)   (Correct)
34.7   Two Components of An Action Language - Lifschitz (1996)   (Correct)
34.5   Sur La Complexité Des Suites Infinies - Allouche (1994)   (Correct)
34.5   Polynomial Algorithms for the Synthesis of Bounded Nets - Badouel, Bernardinello, Darondeau (1994)   (Correct)
34.0   Possibly Infinite Sequences in Theorem Provers: A Comparative Study - Devillers, Griffioen, Müller (1997)   (Correct)
32.9   The Three Dimensions of Requirements Engineering - Pohl (1993)   (Correct)
32.0   Artificial Intelligence: A Computational Perspective - Nebel (1994)   (Correct)
32.0   On the Interleaving Semantics of Transformation Units - A Step into.. - Kreowski, Kuske (1994)   (Correct)
32.0   Modular Logic Programming - Brogi, Mancarella, Pedreschi, Turini (1994)   (Correct)
31.8   Data-Oriented Language Processing - An Overview - Bod, Scha (1996)   (Correct)
31.8   On Probabilistic Model Checking - Huth, Kwiatkowska (1996)   (Correct)
31.8   Building Ontologies: Towards a Unified Methodology - Uschold (1996)   (Correct)
31.8   Parametricity and Local Variables - O'Hearn, Tennent (1995)   (Correct)
31.8   Lattice Frameworks for Multisource and Bidirectional Data Flow.. - Masticola (1995)   (Correct)
31.8   Formal Specification Languages in Knowledge and Software Engineering - Fensel (1995)   (Correct)
29.7   Disjunctive Datalog - Eiter, Gottlob, Mannila (1997)   (Correct)
29.7   Parsing of Context-Free Languages - Sikkel, Nijholt (1997)   (Correct)
29.7   An Ontology-based Broker: Making Problem-Solving Method Reuse Work - Fensel (1997)   (Correct)
29.7   Joining and Rotating Data with Molecules - Arita, Hagiya, Suyama (1997)   (Correct)
29.7   Reserved Graph Grammar: A Specification Tool for Diagrammatic VPLs - Zhang, Zhang (1997)   (Correct)
29.7   Containment of Regular Languages in Non-Regular Timing Diagram.. - Fisler (1997)   (Correct)
28.9   Syntactic Codes and Grammar Refinement - Kracht (1995)   (Correct)
28.8   Asymptotic Properties Of Data Compression And Suffix Trees - Szpankowski (1993)   (Correct)
28.5   An Evaluation of Scenario Notations for Telecommunication Systems.. - Amyot, Eberlein (2001)   (Correct)
28.5   An Integrated Environment for Knowledge Acquisition - Blythe, Kim, Ramachandran, Gil (2001)   (Correct)
28.5   Probabilistic Logic under Coherence: Complexity and Algorithms - Biazzo, Gilio, Lukasiewicz.. (2001)   (Correct)
28.5   Basic Analytic Combinatorics of Directed Lattice Paths - Banderier, Flajolet (2001)   (Correct)
28.5   Uni-transitional Watson-Crick D0L systems - Salomaa (2001)   (Correct)
28.5   A Formal Semantics for UML Activity Diagrams - Formalising Workflow.. - Eshuis, Wieringa (2001)   (Correct)
28.5   Representation Results for Defeasible Logic - Antoniou, Billington, Governatori.. (2001)   (Correct)
28.5   Finite Automata with Generalized Acceptance Criteria - Peichl, Vollmer (2001)   (Correct)
28.5   Integrating Expectations from Different Sources to Help End Users.. - Jim Blythe Information (2001)   (Correct)
28.5   Free monoid completeness of the Lambek calculus allowing empty.. - Pentus (2001)   (Correct)
28.5   Logic Programming Revisited: Logic Programs as Inductive Definitions - Denecker, Bruynooghe, Marek (2001)   (Correct)
28.5   From RM-ODP to the formal behavior representation - Balabko, Wegmann (2001)   (Correct)
28.5   Logics of Metric Spaces - Kutz, Wolter, Sturm, Suzuki.. (2001)   (Correct)
28.5   Logics with Counting and Local Properties - Libkin (2000)   (Correct)
28.5   Length Distributions And Regular Sequences - Bassino, Béal, Perrin (2000)   (Correct)
28.5   Using a Coordination Language to Specify and Analyze Systems.. - Ciancarini, Franzè, Mascolo (2000)   (Correct)
28.5   On the Power of Tree-Walking Automata - Neven, Schwentick (2000)   (Correct)
28.5   A Systematic Design of Real-time Systems Using Duration Calculus - Van Nhon, Van Hung (2000)   (Correct)
28.5   Formalising the Chisel Feature Notation - Turner (2000)   (Correct)
28.5   The Mathematical Vernacular - Wiedijk (2000)   (Correct)
28.5   Multiple Dispatch as Dispatch on Tuples - Leavens, Millstein (1998)   (Correct)
28.5   An inductive view of graph transformation - Gadducci, Heckel (1998)   (Correct)
28.5   Controlling Generalization and Polyvariance in Partial Deduction of.. - Leuschel, Martens, De Schreye (1998)   (Correct)
27.9   Automatic Average-Case Analysis Of Algorithms - Flajolet, al. (1991)   (Correct)
27.2   Graph Transformation Units with Interleaving Semantics - Kreowski, Kuske (1999)   (Correct)
27.2   Asymptotic Approximation of the Move-To-Front Search Cost.. - Jelenkovic (1999)   (Correct)
27.2   Decoupling Synchronization from Local Control for Efficient Symbolic.. - William Chan (1999)   (Correct)
27.2   Formally Specified Monitoring of Temporal Properties - Moonjoo Kim (1999)   (Correct)
27.2   On quadratic word equations - Robson, Diekert (1999)   (Correct)
27.2   Towards Truth in HPSG - King (1999)   (Correct)
27.2   Using JFLAP to Interact with Theorems in Automata Theory - Eric Gramond (1999)   (Correct)

CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute