|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 839 occurrences of 448 keywords
|
|
|
Results
Found 2139 publication records. Showing 2139 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
53 | Victor L. Selivanov |
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 539-550, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Star-free regular languages, hierarchies, decidability, definability |
53 | Mark Weyer |
Decidability of S1S and S2S. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Automata, Logics, and Infinite Games ![In: Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001], pp. 207-230, 2001, Springer, 3-540-00388-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
45 | Petr Jancar |
Selected Ideas Used for Decidability and Undecidability of Bisimilarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings, pp. 56-71, 2008, Springer, 978-3-540-85779-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
decidability, bisimulation equivalence |
45 | Mitsuharu Yamamoto, Jean-Marie Cottin, Masami Hagiya |
Decidability of Safety Properties of Timed Multiset Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTRTFT ![In: Formal Techniques in Real-Time and Fault-Tolerant Systems, 7th International Symposium, FTRTFT 2002, Co-sponsored by IFIP WG 2.2, Oldenburg, Germany, September 9-12, 2002, Proceedings, pp. 165-184, 2002, Springer, 3-540-44165-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
real-time systems, timed automata, decidability, timed Petri nets |
45 | Helko Lehmann, Michael Leuschel |
Decidability Results for the Propositional Fluent Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computational Logic ![In: Computational Logic - CL 2000, First International Conference, London, UK, 24-28 July, 2000, Proceedings, pp. 762-776, 2000, Springer, 3-540-67797-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
reasoning about action and change, fluent calculus, model checking, petri nets, temporal logics, decidability |
45 | Matteo Baldoni, Laura Giordano 0001, Alberto Martelli |
A Tableau for Multimodal Logics and Some (Un)Decidability Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX '98, Oisterwijk, The Netherlands, May 5-8, 1998, Proceedings, pp. 44-59, 1998, Springer, 3-540-64406-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Multimodal logics, Prefixed Tableaux methods, Decidability, Formal Grammars |
45 | Qing Zhou, Weihao Hu |
Decidability in Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 75(4), pp. 319-336, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
almost decidable, Decidable |
45 | Slawomir Lasota 0001 |
Decidability of Strong Bisimilarity for Timed BPP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings, pp. 562-578, 2002, Springer, 3-540-44043-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
39 | Antje Nowack |
A Guarded Fragment for Abstract State Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 14(3), pp. 345-368, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Datalog LITE, guarded fixed-point logic, computability, decidability, Abstract State Machines, expressive power, guarded fragment |
39 | Joe Hendrix, Hitoshi Ohsaki |
Combining Equational Tree Automata over AC and ACI Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings, pp. 142-156, 2008, Springer, 978-3-540-70588-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
39 | Alberto Casagrande, Pietro Corvaja, Carla Piazza, Bud Mishra |
Composing Semi-algebraic O-Minimal Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 10th International Workshop, HSCC 2007, Pisa, Italy, April 3-5, 2007, Proceedings, pp. 668-671, 2007, Springer, 978-3-540-71492-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
39 | Colin Stirling |
Schema Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000, Proceedings, pp. 126-138, 2000, Springer, 3-540-67895-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
37 | Sergey Babenyshev, Vladimir V. Rybakov |
Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings, pp. 32-41, 2008, Springer, 978-3-540-69405-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
multi-agent logics, relational Kripke-Hintikka models, decidability algorithms, satisfiability, linear temporal logic, hybrid logics |
37 | Davide Bresolin, Valentin Goranko, Angelo Montanari, Guido Sciavicco |
On Decidability and Expressiveness of Propositional Interval Neighborhood Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings, pp. 84-99, 2007, Springer, 978-3-540-72732-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
neighbourhood interval logics, decidability, expressiveness |
37 | Ralf Küsters |
On the decidability of cryptographic protocols with open-ended data structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Inf. Sec. ![In: Int. J. Inf. Sec. 4(1-2), pp. 49-70, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Complexity, Cryptographic protocols, Decidability, Transducers |
37 | Petr Hlinený, Detlef Seese |
On Decidability of MSO Theories of Representable Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 96-107, 2004, Springer, 3-540-23071-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
MSO theory, decidability, matroid, branch-width |
37 | Fabio Balduzzi, Angela Di Febbraro, Alessandro Giua, Carla Seatzu |
Decidability results in First-Order Hybrid Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Event Dyn. Syst. ![In: Discret. Event Dyn. Syst. 11(1-2), pp. 41-57, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
hybrid Petri nets, decidability properties, timed automata, hybrid automata |
37 | Peng Cheng 0009, George J. Pappas, Vijay Kumar 0001 |
Decidability of Motion Planning with Differential Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICRA ![In: 2007 IEEE International Conference on Robotics and Automation, ICRA 2007, 10-14 April 2007, Roma, Italy, pp. 1826-1831, 2007, IEEE. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Laura Recalde, Serge Haddad, Manuel Silva Suárez |
Continuous Petri Nets: Expressive Power and Decidability Issues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis, 5th International Symposium, ATVA 2007, Tokyo, Japan, October 22-25, 2007, Proceedings, pp. 362-377, 2007, Springer, 978-3-540-75595-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Hubert Comon-Lundh, Véronique Cortier |
New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings, pp. 148-164, 2003, Springer, 3-540-40254-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
37 | Colin Stirling |
Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures, 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings, pp. 379-393, 2001, Springer, 3-540-41864-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
37 | Manoranjan Satpathy, Dang Van Hung, Paritosh K. Pandya |
Some Decidability Results for Duration Calculus under Synchronous Interpretation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTRTFT ![In: Formal Techniques in Real-Time and Fault-Tolerant Systems, 5th International Symposium, FTRTFT'98, Lyngby, Denmark, September 14-18, 1998, Proceedings, pp. 186-197, 1998, Springer, 3-540-65003-2. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
32 | Monika Rauch Henzinger, Thomas A. Henzinger, Peter W. Kopke |
Computing Simulations on Finite and Infinite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 453-462, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
simulations computing, infinite graphs, finite graphs, labeled graphs, reactive systems verification, O(mn) algorithm, symbolic similarity-checking procedure, 2D rectangular automata, continuous environments, model-checking problem, graph theory, decidability, decidability, automata theory, similarity relations |
32 | Robert Beals |
Algorithms for Matrix Groups and the Tits Alternative. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 593-602, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
finitely generated linear group, nonabelian free group, solvable subgroup, finite index, finitely generated matrix group, nonabelian free subgroups, nilpotent subgroup, encoding length, computational complexity, complexity, encoding, polynomial time algorithm, decidability, decidability, matrix algebra, formal logic, homomorphism, group theory, finite groups, matrix groups, algebraic number field, Las Vegas algorithm, membership testing |
32 | Lucia Acciai, Michele Boreale |
Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, pp. 31-42, 2009, Springer, 978-3-642-02929-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
behavioural types, safety, decidability, pi-calculus, spatial logic |
32 | Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas 0001, Volker Weber, Felix Weiss |
The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 587-599, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Post’s lattice, complexity, satisfiability, decidability, hybrid logic |
32 | Renate A. Schmidt, Ullrich Hustadt |
The axiomatic translation principle for modal logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 8(4), pp. 19, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Translation approach, small model property, completeness, decidability |
32 | Martin Fränzle, Michael R. Hansen |
Deciding an Interval Logic with Accumulated Durations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 13th International Conference, TACAS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007 Braga, Portugal, March 24 - April 1, 2007, Proceedings, pp. 201-215, 2007, Springer, 978-3-540-71208-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
metric-time temporal logic, multi-priced timed automata, Real-time systems, model-checking, decidability |
32 | Hitoshi Ohsaki, Hiroyuki Seki |
Languages Modulo Normalization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FroCoS ![In: Frontiers of Combining Systems, 6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007, Proceedings, pp. 221-236, 2007, Springer, 978-3-540-74620-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
tree automata modulo axioms, equational rewriting, Boolean closedness, hedge automata and XML schema, regularity, decidability |
32 | Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos |
Monotone AC-Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 12th International Conference, LPAR 2005, Montego Bay, Jamaica, December 2-6, 2005, Proceedings, pp. 337-351, 2005, Springer, 3-540-30553-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
equational tree automata, complexity, decidability, closure properties |
32 | Healfdene Goguen |
A syntactic approach to eta equality in type theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2005, Long Beach, California, USA, January 12-14, 2005, pp. 75-84, 2005, ACM, 1-58113-830-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
beta-eta equality, decidability, type checking, logical frameworks |
32 | Bernhard Heinemann |
Algebras as Knowledge Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 471-482, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
modal and hybrid logic, knowledge and algebras, decidability, topological reasoning, reasoning about knowledge |
32 | Martin Fränzle |
Model-checking dense-time Duration Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 16(2), pp. 121-139, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Dense-time Duration Calculus, Model-checking, Decidability |
32 | Bernhard Heinemann |
A Hybrid Logic of Knowledge Supporting Topological Reasoning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMAST ![In: Algebraic Methodology and Software Technology, 10th International Conference, AMAST 2004, Stirling, Scotland, UK, July 12-16, 2004, Proceedings, pp. 181-195, 2004, Springer, 3-540-22381-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
logical frameworks for reasoning, reasoning about knowledge and topology, completeness, decidability, hybridization |
32 | Martin Fränzle |
What Will Be Eventually True of Polynomial Hybrid Automata? ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACS ![In: Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, Sendai, Japan, October 29-31, 2001, Proceedings, pp. 340-359, 2001, Springer, 3-540-42736-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
State recurrence, Progress properties, Verification procedures, Hybrid systems, Decidability |
32 | Hitoshi Ohsaki |
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings, pp. 539-553, 2001, Springer, 3-540-42554-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
decidability, Tree automata, equational theory |
31 | Petr Jancar, Jirí Srba |
Undecidability of bisimilarity by defender's forcing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 55(1), pp. 5:1-5:26, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
process algebra, undecidability, pushdown automata, Bisimilarity |
31 | Alberto Casagrande, Pietro Corvaja, Carla Piazza, Bud Mishra |
Decidable Compositions of O-Minimal Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis, 6th International Symposium, ATVA 2008, Seoul, Korea, October 20-23, 2008. Proceedings, pp. 274-288, 2008, Springer, 978-3-540-88386-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Christopher A. Stone, Robert Harper 0001 |
Extensional equivalence and singleton types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 7(4), pp. 676-722, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
equivalence algorithms, logical relations, Singleton types |
31 | Antje Nowack |
Deciding the Verification Problem for Abstract State Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Abstract State Machines ![In: Abstract State Machines, Advances in Theory and Practice, 10th International Workshop, ASM 2003, Taormina, Italy, March 3-7, 2003, Proceedings, pp. 341-355, 2003, Springer, 3-540-00624-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Max I. Kanovich |
The Expressive Power of Horn Monadic Linear Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings, pp. 39-53, 2001, Springer, 3-540-42554-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Jordi Levy |
Decidable and Undecidable Second-Order Unification Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings, pp. 47-60, 1998, Springer, 3-540-64301-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
30 | Wei Zhang |
On the decidability of open logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Ser. F Inf. Sci. ![In: Sci. China Ser. F Inf. Sci. 52(8), pp. 1283-1291, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
open logic, epistemic process, decidability |
30 | Chan Le Duc |
Decidability of SHI with Transitive Closure of Roles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESWC ![In: The Semantic Web: Research and Applications, 6th European Semantic Web Conference, ESWC 2009, Heraklion, Crete, Greece, May 31-June 4, 2009, Proceedings, pp. 368-383, 2009, Springer, 978-3-642-02120-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
OWL, Description Logics, Decidability, Tableaux |
30 | Ivan Lanese, Jorge A. Pérez 0001, Davide Sangiorgi, Alan Schmitt |
On the Expressiveness and Decidability of Higher-Order Process Calculi. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 145-155, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
behavioral equivalences, decidability, expressiveness, process calculi, higher-order languages |
30 | Zhenhua Duan, Cong Tian |
Decidability of Propositional Projection Temporal Logic with Infinite Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, pp. 521-532, 2007, Springer, 978-3-540-72503-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
infinite model, model checking, satisfiability, decidability, interval temporal logic |
30 | Alexander Arbieto, Carlos Matheus |
Decidability of Chaos for Some Families of Dynamical Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 4(3), pp. 269-275, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Lyapounov exponents, SRB measures, Topological entropy, Decidability, Chaos |
30 | Laurent Mazaré |
Decidability of Opacity with Non-Atomic Keys. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects in Security and Trust ![In: Formal Aspects in Security and Trust: Second IFIP TC1 WG1.7 Workshop on Formal Aspects in Security and Trust (FAST), an event of the 18th IFIP World Computer Congress, August 22-27, 2004, Toulouse, France, pp. 71-84, 2004, Springer, 0-387-24050-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Dolev-Yao Constraints, Security, Formal Verification, Decidability, Rewriting Systems, Opacity |
30 | Géraud Sénizergues |
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 120-129, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
equational graphs, deterministic pushdown automata, rational languages, matrix semi-groups, complete formal systems, decidability, bisimulation |
29 | Fernando Rosa-Velardo, David de Frutos-Escrig |
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Petri Nets ![In: Applications and Theory of Petri Nets, 30th International Conference, PETRI NETS 2009, Paris, France, June 22-26, 2009. Proceedings, pp. 63-82, 2009, Springer, 978-3-642-02423-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Matthias Horbach, Christoph Weidenbach |
Decidability Results for Saturation-Based Model Building. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-22, 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009. Proceedings, pp. 404-420, 2009, Springer, 978-3-642-02958-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Thomas Chatain, Paul Gastin, Nathalie Sznajder |
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings, pp. 141-152, 2009, Springer, 978-3-540-95890-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Distributed synthesis, Asynchronous systems |
29 | Jacques Sakarovitch, Rodrigo de Souza |
On the Decidability of Bounded Valuedness for Transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, pp. 588-600, 2008, Springer, 978-3-540-85237-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Marc Bezem, Tore Langholm, Michal Walicki |
Completeness and Decidability in Sequence Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings, pp. 123-137, 2007, Springer, 978-3-540-75558-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Christopher Lynch, Duc-Khanh Tran |
Automatic Decidability and Combinability Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-21, 21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007, Proceedings, pp. 328-344, 2007, Springer, 978-3-540-73594-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Agostino Dovier, Andrea Formisano 0001, Eugenio G. Omodeo |
Decidability results for sets with atoms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 7(2), pp. 269-301, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Prenex sentences, set-hyperset theories, syllogistics, unification, quantifier elimination, satisfiability problem |
29 | Riccardo Rosati 0001 |
On the decidability and finite controllability of query processing in databases with incomplete information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, USA, pp. 356-365, 2006, ACM, 1-59593-318-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Maria Paola Bonacina, Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, Daniele Zucchelli |
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, pp. 513-527, 2006, Springer, 3-540-37187-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Rakesh M. Verma, Ara Hayrapetyan |
A new decidability technique for ground term rewriting systems with applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 6(1), pp. 102-123, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
standard forms, unique normalization, decision procedures, rewriting, Confluence, pumping lemma |
29 | Michael Domaratzki, Kai Salomaa |
Decidability of Trajectory-Based Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 723-734, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Henning Bordihn, Markus Holzer 0001, Martin Kutrib |
Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers, pp. 68-79, 2004, Springer, 3-540-24318-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Franz Baader, Silvio Ghilardi, Cesare Tinelli |
A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning - Second International Joint Conference, IJCAR 2004, Cork, Ireland, July 4-8, 2004, Proceedings, pp. 183-197, 2004, Springer, 3-540-22345-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Yasunori Ishihara, Yumi Shimakawa, Toru Fujiwara |
Type Inferability and Decidability of the Security Problem Against Inference Attacks on Object-Oriented Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICICS ![In: Information and Communications Security, 6th International Conference, ICICS 2004, Malaga, Spain, October 27-29, 2004, Proceedings, pp. 145-157, 2004, Springer, 3-540-23563-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Silvio Ghilardi, Luigi Santocanale |
Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, Proceedings, pp. 152-166, 2003, Springer, 3-540-20101-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Manfred Schmidt-Schauß |
Decidability of Arity-Bounded Higher-Order Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings, pp. 488-502, 2003, Springer, 3-540-40559-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Heinz Faßbender, Sebastian Maneth |
A Strict Border for the Decidability of E-Unification for Recursive Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALP ![In: Algebraic and Logic Programming, 5th International Conference, ALP'96, Aachen, Germany, September 25-27, 1996, Proceedings, pp. 194-208, 1996, Springer, 3-540-61735-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
29 | Salvatore Ruggieri |
Decidability of Logic Program Semantics and Applications to Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLILP ![In: Programming Languages: Implementations, Logics, and Programs, 8th International Symposium, PLILP'96, Aachen, Germany, September 24-27, 1996, Proceedings, pp. 347-362, 1996, Springer, 3-540-61756-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
29 | Parosh Aziz Abdulla, Mats Kindahl |
Decidability of Simulation and Bisimulation between Lossy Channel Systems and Finite State Systems (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR '95: Concurrency Theory, 6th International Conference, Philadelphia, PA, USA, August 21-24, 1995, Proceedings, pp. 333-347, 1995, Springer, 3-540-60218-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
29 | Paritosh K. Pandya |
Some Extensions to Propositional Mean-Value Caculus: Expressiveness and Decidability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 9th International Workshop, CSL '95, Annual Conference of the EACSL, Paderborn, Germany, September 22-29, 1995, Selected Papers, pp. 434-451, 1995, Springer, 3-540-61377-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
29 | Petr Jancar |
Decidability Questions for Bismilarity of Petri Nets and Some Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings, pp. 581-592, 1994, Springer, 3-540-57785-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
29 | Karel Culík II |
New Techniques for Proving the Decidability of Equivalence Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings, pp. 162-175, 1988, Springer, 3-540-19488-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
27 | Giangiacomo Gerla |
Decidability, partial decidability and sharpness relation for L-subsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 46(3), pp. 227-238, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
24 | Maria Bulinska |
On the Complexity of Nonassociative Lambek Calculus with Unit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 93(1), pp. 1-14, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Nonassociative Lambek calculus, P-TIME decidability, Context-free grammar |
24 | C. R. Prashanth, S. P. Ganavi, T. D. Mahalakshmi, K. B. Raja, K. R. Venugopal 0001, Lalit M. Patnaik |
Iris feature extraction using directional filter bank for personal identification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bangalore Compute Conf. ![In: Proceedings of the 2nd Bangalore Annual Compute Conference, Compute 2009, Bangalore, India, January 9-10, 2009, pp. 6, 2009, ACM, 978-1-60558-476-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
decidability index, directional filter bank, iris fragmentation, biometrics, iris recognition |
24 | Sergey Babenyshev, Vladimir V. Rybakov |
Temporal Logic for Modeling Discovery and Logical Uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES (2) ![In: Knowledge-Based and Intelligent Information and Engineering Systems, 13th International Conference, KES 2009, Santiago, Chile, September 28-30, 2009, Proceedings, Part II, pp. 16-23, 2009, Springer, 978-3-642-04591-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
decidability algorithms, Kripke/Hintikka models, temporal logic, uncertainty, chance discovery |
24 | Gerardo Schneider |
Reachability analysis of generalized polygonal hybrid systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), Fortaleza, Ceara, Brazil, March 16-20, 2008, pp. 327-332, 2008, ACM, 978-1-59593-753-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
GSPDI, verification, hybrid systems, decidability, reachability |
24 | Vladimir V. Rybakov |
Multi-agent Logics with Interacting Agents Based on Linear Temporal Logic: Deciding Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAISC ![In: Artificial Intelligence and Soft Computing - ICAISC 2008, 9th International Conference, Zakopane, Poland, June 22-26, 2008, Proceedings, pp. 1243-1253, 2008, Springer, 978-3-540-69572-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
multi-agent logic, knowledge based reasoning, relational Kripke/Hintikka models, decidability algorithms, hybrid logics |
24 | Carsten Lutz, Maja Milicic |
A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 38(1-3), pp. 227-259, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
concrete domains, tableau algorithm, description logic, decidability |
24 | Michael R. Hansen, Dang Van Hung |
A Theory of Duration Calculus with Application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Domain Modeling and the Duration Calculus ![In: Domain Modeling and the Duration Calculus, International Training School, Shanghai, China, September 17-21. 2007, Advanced Lectures, pp. 119-176, 2007, Springer, 978-3-540-74963-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
metric-time temporal logic, Real-time systems, model-checking, application, decidability, duration calculus |
24 | Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin |
Two-variable logic on data trees and XML reasoning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, USA, pp. 10-19, 2006, ACM, 1-59593-318-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
data trees, first-order logic, decidability |
24 | Andrzej Grzegorczyk |
Undecidability without Arithmetization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 79(2), pp. 163-230, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
discernibility, Kurt Gödel, Alfred Tarski, representability, decidability, arithmetization, concatenation |
24 | Stefan S. Dantchev, Frank D. Valencia |
On the computational limits of infinite satisfaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, March 13-17, 2005, pp. 393-397, 2005, ACM, 1-58113-964-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
infinite CSP, open CSP, decidability, constraint satisfaction problems |
24 | Luigi Di Lascio |
Analytic fuzzy tableaux. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 5(6), pp. 434-439, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Fuzzy deductive systems, Fuzzy logic, Completeness, Decidability, Soundness, Tableaux |
24 | Kosta Dosen, Zoran Petric |
Coherent Bicartesian and Sesquicartesian Categories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Theory in Computer Science ![In: Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings, pp. 78-92, 2001, Springer, 3-540-42752-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
categorial proof theory, conjunction and disjunction, decidability of equality of deductions Mathematics Subject Classification (2000): 18A30, 18A15, 03G30, 03F05 |
24 | Bartek Klin, Piotr Hoffman, Andrzej Tarlecki, Lutz Schröder, Till Mossakowski |
Checking Amalgamability Conditions for C ASL Architectural Specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 451-463, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
formal specification and program development, CASL, algorithms, decidability, architectural specifications, amalgamation |
24 | Hsu-Chun Yen |
Analysis of Self-Stabilization for Infinite-State Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICECCS ![In: 7th International Conference on Engineering of Complex Computer Systems (ICECCS 2001), 11-13 June 2001, Skövde, Sweden, pp. 240-248, 2001, IEEE Computer Society, 0-7695-1159-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Petri net, self-stabilization, Decidability, infinite-state system |
24 | Witold Charatonik, Andreas Podelski |
Set Constraints with Intersection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997, pp. 362-372, 1997, IEEE Computer Society, 0-8186-7925-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
satisfiability test, set-based program analysis, DEXPTIME-complete, complexity characterization, negative set constraints, negated conjuncts, negated inclusion, computability, decidability, intersection, inclusions, set constraints |
23 | Limin Jia 0001, Jianzhou Zhao, Vilhelm Sjöberg, Stephanie Weirich |
Dependent types and program equivalence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, January 17-23, 2010, pp. 275-286, 2010, ACM, 978-1-60558-479-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
dependent types, program equivalence |
23 | Jeremy E. Dawson, Alwen Tiu |
Formalising Observer Theory for Environment-Sensitive Bisimulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings, pp. 180-195, 2009, Springer, 978-3-642-03358-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Alwen Tiu, Rajeev Goré |
A Proof Theoretic Analysis of Intruder Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009, Proceedings, pp. 103-117, 2009, Springer, 978-3-642-02347-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
AC convergent theories, intruder deduction, security protocols, sequent calculus |
23 | Guillem Godoy, Sebastian Maneth, Sophie Tison |
Classes of Tree Homomorphisms with Decidable Preservation of Regularity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings, pp. 127-141, 2008, Springer, 978-3-540-78497-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Carlos Olarte, Frank D. Valencia |
The expressivity of universal timed CCP: undecidability of Monadic FLTL and closure operators for security. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 15-17, 2008, Valencia, Spain, pp. 8-19, 2008, ACM, 978-1-60558-117-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
first-order linear temporal logic, security protocols, closure operators, concurrent constraint programming |
23 | Riccardo Rosati 0001 |
On Combining Description Logic Ontologies and Nonrecursive Datalog Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RR ![In: Web Reasoning and Rule Systems, Second International Conference, RR 2008, Karlsruhe, Germany, October 31-November 1, 2008. Proceedings, pp. 13-27, 2008, Springer, 978-3-540-88736-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune |
Combining Algorithms for Deciding Knowledge in Security Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FroCoS ![In: Frontiers of Combining Systems, 6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007, Proceedings, pp. 103-117, 2007, Springer, 978-3-540-74620-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Petr Jancar, Jirí Srba |
Undecidability Results for Bisimilarity on Prefix Rewrite Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures, 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006, Proceedings, pp. 277-291, 2006, Springer, 3-540-33045-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Nadia Busi |
Deciding Behavioural Properties in Brane Calculi. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CMSB ![In: Computational Methods in Systems Biology, International Conference, CMSB 2006, Trento, Italy, October 18-19, 2006, Proceedings, pp. 17-31, 2006, Springer, 3-540-46166-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Piotr Hoffman |
Unions of Equational Monadic Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings, pp. 81-95, 2006, Springer, 3-540-36834-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Ullrich Hustadt, Boris Konev, Renate A. Schmidt |
Deciding Monodic Fragments by Temporal Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-20, 20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005, Proceedings, pp. 204-218, 2005, Springer, 3-540-28005-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Piotr Hoffman |
Union of Equational Theories: An Algebraic Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, pp. 61-73, 2005, Springer, 3-540-25596-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Laura Bozzelli |
Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation, 6th International Conference, VMCAI 2005, Paris, France, January 17-19, 2005, Proceedings, pp. 282-297, 2005, Springer, 3-540-24297-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 2139 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|