|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 16 occurrences of 9 keywords
|
|
|
|
|
Results
Found 40 publication records. Showing 40 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell |
On the Complexity of the Equivalence Problem for Probabilistic Automata.  |
FoSSaCS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell |
On the Complexity of the Equivalence Problem for Probabilistic Automata  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang |
On Stabilization in Herman's Algorithm  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang |
On Stabilization in Herman's Algorithm.  |
ICALP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong |
A Fragment of ML Decidable by Visibly Pushdown Automata.  |
ICALP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell |
Language Equivalence for Probabilistic Automata.  |
CAV  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski, Nikos Tzevelekos |
Game Semantics for Good General References.  |
LICS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski, Nikos Tzevelekos |
Algorithmic Nominal Game Semantics.  |
ESOP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski |
Full Abstraction Without Synchronization Primitives.  |
Electr. Notes Theor. Comput. Sci.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski, Nikos Tzevelekos |
Block Structure vs. Scope Extrusion: Between Innocence and Omniscience.  |
FOSSACS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski, Nikos Tzevelekos |
Full Abstraction for Reduced ML.  |
FOSSACS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski, Igor Walukiewicz |
Third-order Idealized Algol with iteration is decidable.  |
Theor. Comput. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan R. Ghica, Andrzej S. Murawski |
Angelic semantics of fine-grained concurrency.  |
Ann. Pure Appl. Logic  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Axel Legay, Andrzej S. Murawski, Joël Ouaknine, James Worrell |
On Automated Verification of Probabilistic Programs.  |
TACAS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre |
Collapsible Pushdown Automata and Recursion Schemes.  |
LICS  |
2008 |
DBLP DOI BibTeX RDF |
Higher-order pushdown automata, game semantics, higher-order recursion schemes |
| 1 | Andrzej S. Murawski |
Reachability Games and Game Semantics: Comparing Nondeterministic Programs.  |
LICS  |
2008 |
DBLP DOI BibTeX RDF |
Idealized Algol, pushdown graphs, reachability games, nondeterminism, game semantics |
| 1 | Andrzej S. Murawski |
Bad Variables Under Control.  |
CSL  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong |
Syntactic control of concurrency.  |
Theor. Comput. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski, C.-H. Luke Ong |
Fast verification of MLL proof nets via IMLL.  |
ACM Trans. Comput. Log.  |
2006 |
DBLP DOI BibTeX RDF |
Multiplicative linear logic, disjoint union find, essential nets, dominator trees, proof nets |
| 1 | Dan R. Ghica, Andrzej S. Murawski |
Compositional Model Extraction for Higher-Order Concurrent Programs.  |
TACAS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski |
Games for complexity of second-order call-by-name programs.  |
Theor. Comput. Sci.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski |
Functions with local state: Regularity and undecidability.  |
Theor. Comput. Sci.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski |
About the undecidability of program equivalence in finitary languages with state.  |
ACM Trans. Comput. Log.  |
2005 |
DBLP DOI BibTeX RDF |
Idealized Algol, Game semantics, program equivalence |
| 1 | Andrzej S. Murawski, Joël Ouaknine |
On Probabilistic Program Equivalence and Refinement.  |
CONCUR  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski |
Functions with local state: from regularity to undecidability.  |
GALOP  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz |
Idealized Algol with Ground Recursion, and DPDA Equivalence.  |
ICALP  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski, Igor Walukiewicz |
Third-Order Idealized Algol with Iteration Is Decidable.  |
FoSSaCS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski, C.-H. Luke Ong |
On an interpretation of safe recursion in light affine logic.  |
Theor. Comput. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong |
Applying Game Semantics to Compositional Software Modeling and Verification.  |
TACAS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong |
Syntactic Control of Concurrency.  |
ICALP  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong, Ian D. B. Stark |
Nominal Games and Full Abstraction for the Nu-Calculus.  |
LICS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan R. Ghica, Andrzej S. Murawski |
Angelic Semantics of Fine-Grained Concurrency.  |
FoSSaCS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski, C.-H. Luke Ong |
Exhausting strategies, joker games and full completeness for IMLL with Unit.  |
Theor. Comput. Sci.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski |
On Program Equivalence in Languages with Ground-Type References.  |
LICS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski, Kwangkeun Yi |
Static Monotonicity Analysis for lambda-definable Functions over Lattices.  |
VMCAI  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski, C.-H. Luke Ong |
Evolving Games and Essential Nets for Affine Polymorphism.  |
TLCA  |
2001 |
DBLP DOI BibTeX RDF |
Full Completeness, Polymorphism, Linear Logic, Game Semantics |
| 1 | Andrzej S. Murawski, Kwangkeun Yi |
Static Monotonicity Analysis for lambda-Definable Functions. over Lattices.  |
APLAS  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Andrzej S. Murawski, C.-H. Luke Ong |
Dominator Trees and Fast Verification of Proof Nets.  |
LICS  |
2000 |
DBLP DOI BibTeX RDF |
verification of proof nets, Linear Logic, dominator trees |
| 1 | Andrzej S. Murawski, C.-H. Luke Ong |
Discreet Games, Light Affine Logic and PTIME Computation.  |
CSL  |
2000 |
DBLP DOI BibTeX RDF |
PTIME, Complexity, Linear Logic, Game Semantics |
| 1 | Andrzej S. Murawski, C.-H. Luke Ong |
Exhausting Strategies, Joker Games and IMLL with Units.  |
Electr. Notes Theor. Comput. Sci.  |
1999 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #40 of 40 (100 per page; Change: )
|
|