Publications : 2016
-
[BKM16]
-
M. Blondin, A. Krebs, and P. McKenzie.
The Complexity of Intersecting Finite Automata Having Few Final
States.
Computational Complexity, 25(4):775--814, December 2016.
To appear.
doi:
10.1007/s00037-014-0089-9.
[ BibTex |
DOI |
Web page |
PDF ]
-
[The16]
-
S. Theissing.
Supervision in Multi-Modal Transportation System.
Thèse de doctorat, École Normale Supérieure Paris-Saclay,
France, December 2016.
[ BibTex |
Web page |
PDF ]
-
[Bol16]
-
B. Bollig.
One-Counter Automata with Counter Observability.
In Proceedings of the 36th Conference on Foundations of
Software Technology and Theoretical Computer Science (FSTTCS'16),
volume 65 of Leibniz International Proceedings in Informatics, pages
20:1--20:14, Chennai, India, December 2016. Leibniz-Zentrum für
Informatik.
doi:
10.4230/LIPIcs.FSTTCS.2016.20.
[ BibTex |
DOI |
Web page ]
-
[Gou16d]
-
J. Goubault-Larrecq.
A semantics for .
Invited talk, Dale Miller Festschrift, Paris Diderot University,
Paris, December 2016.
[ BibTex ]
-
[AD16b]
-
P. Arrighi and G. Dowek.
What is the Planck constant the magnitude of?
preprint, December 2016.
[ BibTex |
Web page |
PDF ]
-
[Hal16a]
-
P. Halmagrand.
Automated Deduction and Proof Certification for the B Method.
Thèse de doctorat, Conservatoire National Des Arts et
Métiers, Paris, December 2016.
[ BibTex |
Web page ]
-
[BGMS16b]
-
P. Beame, N. Grosshans, P. McKenzie, and L. Segoufin.
Nondeterminism and An Abstract Formulation of Nečiporuk's
Lower Bound Method.
ACM Transactions on Computation Theory, 9(1):5:1--5:34, December
2016.
doi:
10.1145/3013516.
[ BibTex |
DOI ]
-
[Van16]
-
M. Van den Bogaard.
Motifs de Flot d'Information dans les Jeux à Information
Imparfaite.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, November 2016.
[ BibTex |
Web page |
PDF ]
-
[MPTAS16]
-
D. Montoya, T. Pellissier Tanon, S. Abiteboul, and
F. Suchanek.
Thymeflow, A Personal Knowledge Base with
Spatio-temporal Data.
In Proceedings of the 25th ACM International Conference on
Information and Knowledge Management (CIKM'16), pages 2477--2480,
Indianapolis, Indiana, USA, October 2016. ACM.
doi:
10.1145/2983323.2983337.
[ BibTex |
DOI |
PDF ]
-
[Moh16]
-
S. Mohamed.
Une méthode topologique pour la recherche d'ensembles
invariants de systèmes continus et à commutation.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, October 2016.
[ BibTex |
Web page |
PDF ]
-
[Cau16b]
-
R. Cauderlier.
Object-Oriented Mechanisms for Interoperability between Proof
Systems.
Thèse de doctorat, Conservatoire National Des Arts et
Métiers, Paris, October 2016.
[ BibTex |
Web page |
PDF ]
-
[DGL16]
-
S. Demri, V. Goranko, and M. Lange.
Temporal Logics in Computer Science, volume 58 of
Cambridge Tracts in Theoretical Computer Science.
Cambridge University Press, October 2016.
[ BibTex |
Web page ]
-
[Hal16b]
-
P. Halmagrand.
Soundly Proving B Method Formulae Using Typed Sequent
Calculus.
In Proceedings of the 13th International Colloquium on
Theoretical Aspects of Computing (ICTAC'16), volume 9965 of Lecture
Notes in Computer Science, pages 196--213, Taipei, Taiwan, October 2016.
Springer.
doi:
10.1007/978-3-319-46750-4_12.
[ BibTex |
DOI |
Web page |
PDF ]
-
[vDCC16a]
-
B. van Dongen, J. Carmona, and Th. Chatain.
Alignment-based Quality Metrics in Conformance Checking.
In Proceedings of the 7th Int. Workshop on Enterprise
Modelling and Information Systems Architectures (EMISA'16), volume
1701 of CEUR Workshop Proceedings, pages 87--90, Vienna, Austria, October
2016. CEUR-WS.org.
[ BibTex |
DOI |
Web page |
PDF ]
-
[MHP16]
-
H. Mandon, S. Haar, and L. Paulevé.
Relationship between the Reprogramming Determinants of Boolean
Networks and their Interaction Graph.
In Proceedings of the 5th International Workshop on Hybrid
Systems Biology, Lecture Notes in Computer Science, pages 113--127,
Grenoble France, October 2016. Springer.
doi:
10.1007/978-3-319-47151-8_8.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BMJ16]
-
P. Bouyer, N. Markey, and V. Jugé.
Dynamic Complexity of Parity Games with Bounded Tree-Width.
Research Report 1610.00571, Computing Research Repository, October
2016.
33 pages.
[ BibTex |
Web page |
PDF ]
-
[CD16a]
-
R. Cauderlier and C. Dubois.
ML Pattern-Matching, Recursion, and Rewriting: From FoCaLiZe
to Dedukti.
In Proceedings of the 13th International Colloquium on
Theoretical Aspects of Computing (ICTAC'16), volume 9965 of Lecture
Notes in Computer Science, pages 459--468, Taipei, Taiwan, October 2016.
Springer.
[ BibTex |
Web page |
PDF ]
-
[Haa16]
-
S. Haar.
Cyclic Ordering through Partial Orders.
Journal of Multiple-Valued Logic and Soft Computing,
27(2-3):209--228, September 2016.
[ BibTex |
Web page |
PDF ]
-
[Jac16]
-
C. Jacomme.
Automated applications of Cryptographic Assumptions.
Rapport de Master, Master Parisien de Recherche en
Informatique, Paris, France, September 2016.
[ BibTex |
PDF ]
-
[HHK+16a]
-
M. Hutagalung, N. Hundeshagen, D. Kuske, M. Lange, and
É. Lozes.
Multi-Buffer Simulations for Trace Language Inclusion.
In Proceedings of the 7th International Symposium on Games,
Automata, Logics, and Formal Verification (GandALF'16), volume 226
of Electronic Proceedings in Theoretical Computer Science, pages 213--227,
Catania, Italy, September 2016.
doi:
10.4204/EPTCS.226.15.
[ BibTex |
DOI |
Web page |
PDF ]
-
[GL16]
-
J. Goubault-Larrecq and J. Lachance.
On the Complexity of Monitoring Orchids Signatures.
In Proceedings of the 16th Conference on Runtime Verification
(RV'16), volume 10012 of Lecture Notes in Computer Science, pages 169--164,
Madrid, Spain, September 2016. Springer.
doi:
10.1007/978-3-319-46982-9_11.
[ BibTex |
DOI ]
-
[KŠHP16]
-
J. Kolcák, D. Šafránek, S. Haar, and
L. Paulevé.
Unfolding of Parametric Logical Regulatory Networks.
In Proceedings of The Seventh International Workshop on
Static Analysis and Systems Biology (SASB 2016), Electronic Notes in
Theoretical Computer Science, Edinburgh, UK, September 2016. Elsevier Science
Publishers.
To appear.
[ BibTex |
Web page |
PDF ]
-
[BDM16]
-
L. Beklemishev, S. Demri, and A. Maté, editors.
Proceedings of the 11th Conference on Advances in Modal
Logic (AiML'16), Budapest, Hungary, September 2016. College
Publications.
[ BibTex |
Web page ]
-
[BMS16]
-
P. Bouyer, N. Markey, and D. Stan.
Stochastic Equilibria under Imprecise Deviations in
Terminal-Reward Concurrent Games.
In Proceedings of the 7th International Symposium on Games,
Automata, Logics, and Formal Verification (GandALF'16), volume 226
of Electronic Proceedings in Theoretical Computer Science, pages 61--75,
Catania, Italy, September 2016.
doi:
10.4204/EPTCS.226.5.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Fin16]
-
A. Finkel.
The Ideal Theory for WSTS.
In Proceedings of the 10th Workshop on Reachability Problems
in Computational Models (RP'16), volume 9899 of Lecture Notes in
Computer Science, pages 1--22, Aalborg, Denmark, September 2016. Springer.
doi:
10.1007/978-3-319-45994-3_1.
[ BibTex |
DOI |
Web page |
PDF ]
-
[ABDL16]
-
N. Alechina, N. Bulling, S. Demri, and B. Logan.
On the Complexity of Resource-Bounded Logics.
In Proceedings of the 10th Workshop on Reachability Problems
in Computational Models (RP'16), volume 9899 of Lecture Notes in
Computer Science, pages 36--50, Aalborg, Denmark, September 2016. Springer.
doi:
10.1007/978-3-319-45994-3_3.
[ BibTex |
DOI |
Web page |
PDF ]
-
[LFS16]
-
A. Le Coënt, L. Fribourg, and R. Soulat.
Compositional analysis of Boolean networks using local
fixed-point iterations.
In Proceedings of the 10th Workshop on Reachability Problems
in Computational Models (RP'16), volume 9899 of Lecture Notes in
Computer Science, pages 134--147, Aalborg, Denmark, September 2016. Springer.
doi:
10.1007/978-3-319-45994-3_10.
[ BibTex |
DOI |
Web page |
PDF ]
-
[LFM+16]
-
A. Le Coënt, L. Fribourg, N. Markey, F. De Vuyst, and
L. Chamoin.
Distributed Synthesis of State-Dependent Switching Control.
In Proceedings of the 10th Workshop on Reachability Problems
in Computational Models (RP'16), volume 9899 of Lecture Notes in
Computer Science, pages 119--133, Aalborg, Denmark, September 2016. Springer.
doi:
10.1007/978-3-319-45994-3_9.
[ BibTex |
DOI |
Web page |
PDF ]
-
[vDCC16b]
-
B. F. van Dongen, J. Carmona, and Th. Chatain.
A Unified Approach for Measuring Precision and Generalization
Based on Anti-Alignments.
In Proceedings of the 14th International Conference on
Business Process Management (BPM'16), volume 9850 of Lecture Notes in
Computer Science, pages 39--56, Rio de Janeiro, Brazil, September 2016.
Springer.
doi:
10.1007/978-3-319-45348-4_3.
[ BibTex |
DOI |
Web page |
PDF ]
-
[KS16]
-
P. Karandikar and Ph. Schnoebelen.
The height of piecewise-testable languages with applications in
logical complexity.
In Proceedings of the 25th Annual EACSL Conference on
Computer Science Logic (CSL'16), volume 62 of Leibniz International
Proceedings in Informatics, pages 37:1--37:22, Marseille, France, September
2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.CSL.2016.37.
[ BibTex |
DOI |
Web page |
PDF ]
-
[GGL16]
-
M. Ganardi, S. Göller, and M. Lohrey.
On the Parallel Complexity of Bisimulation over Finite Systems.
In Proceedings of the 25th Annual EACSL Conference on
Computer Science Logic (CSL'16), volume 62 of Leibniz International
Proceedings in Informatics, pages 12:1--12:17, Marseille, France, September
2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.CSL.2016.12.
[ BibTex |
DOI ]
-
[DGG16b]
-
J. Dubut, É. Goubault, and J. Goubault-Larrecq.
The Directed Homotopy Hypothesis.
In Proceedings of the 25th Annual EACSL Conference on
Computer Science Logic (CSL'16), volume 62 of Leibniz International
Proceedings in Informatics, pages 9:1--9:16, Marseille, France, September
2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.CSL.2016.9.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DBS16]
-
A. Doumane, D. Baelde, and A. Saurin.
Infinitary proof theory: the multiplicative additive case.
In Proceedings of the 25th Annual EACSL Conference on
Computer Science Logic (CSL'16), volume 62 of Leibniz International
Proceedings in Informatics, pages 42:1--42:17, Marseille, France, September
2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.CSL.2016.42.
[ BibTex |
DOI ]
-
[BLS16]
-
D. Baelde, S. Lunel, and S. Schmitz.
A Sequent Calculus for a Modal Logic on Finite Data Trees.
In Proceedings of the 25th Annual EACSL Conference on
Computer Science Logic (CSL'16), volume 62 of Leibniz International
Proceedings in Informatics, pages 32:1--32:16, Marseille, France, September
2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.CSL.2016.32.
[ BibTex |
DOI |
Web page ]
-
[Leh16]
-
M. Lehaut.
PDL on infinite alphabet.
Rapport de Master, Master Parisien de Recherche en
Informatique, Paris, France, August 2016.
19 pages.
[ BibTex |
Web page |
PDF ]
-
[BGMS16a]
-
P. Beame, N. Grosshans, P. McKenzie, and L. Segoufin.
Nondeterminism and an abstract formulation of Neciporuk's
lower bound method.
Research Report 1608.01932, Computing Research Repository, August
2016.
34 pages.
[ BibTex |
Web page |
PDF ]
-
[Lic16]
-
A. Lick.
Systèmes de preuves pour logiques modales.
Rapport de Master, Master Parisien de Recherche en
Informatique, Paris, France, August 2016.
20 pages.
[ BibTex |
Web page |
PDF ]
-
[BFM16]
-
M. Blondin, A. Finkel, and P. McKenzie.
Well Behaved Transition Systems.
Research Report 1608.02636, Computing Research Repository, August
2016.
18 pages.
[ BibTex |
Web page |
PDF ]
-
[FM16]
-
M. Fränzle and N. Markey, editors.
Proceedings of the 14th International Conference on
Formal Modelling and Analysis of Timed Systems (FORMATS'16),
volume 9884 of Lecture Notes in Computer Science, Québec City, Canada,
August 2016. Springer.
doi:
10.1007/978-3-319-44878-7.
[ BibTex |
DOI |
Web page ]
-
[HT16b]
-
S. Haar and S. Theissing.
Decoupling Passenger Flows for Improved Load Prediction.
In Proceedings of the 13th International Conference on
Quantitative Evaluation of Systems (QEST'16), volume 9826 of Lecture
Notes in Computer Science, pages 364--379, Québec City, Canada, August
2016. Springer.
doi:
10.1007/978-3-319-43425-4_24.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Bou16]
-
P. Bouyer.
Optimal Reachability in Weighted Timed Automata and Games.
In Proceedings of the 41st International Symposium on
Mathematical Foundations of Computer Science (MFCS'16), volume 58
of Leibniz International Proceedings in Informatics, pages 3:1--3:3, Krakow,
Poland, August 2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.MFCS.2016.3.
[ BibTex |
DOI |
Web page |
PDF ]
-
[ABK+16]
-
S. Akshay, P. Bouyer, S. N. Krishna, L. Manasa, and
A. Trivedi.
Stochastic Timed Games Revisited.
In Proceedings of the 41st International Symposium on
Mathematical Foundations of Computer Science (MFCS'16), volume 58
of Leibniz International Proceedings in Informatics, pages 8:1--8:14, Krakow,
Poland, August 2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.MFCS.2016.8.
[ BibTex |
DOI |
Web page |
PDF ]
-
[NPR16]
-
R. Niskanen, I. Potapov, and J. Reichert.
Undecidability of Two-dimensional Robot Games.
In Proceedings of the 41st International Symposium on
Mathematical Foundations of Computer Science (MFCS'16), volume 58
of Leibniz International Proceedings in Informatics, pages 73:1--73:13,
Krakow, Poland, August 2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.MFCS.2016.73.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DGG16a]
-
J. Dubut, É. Goubault, and J. Goubault-Larrecq.
Bisimulations and unfolding in P-accessible
categorical models.
In Proceedings of the 27th International Conference on
Concurrency Theory (CONCUR'16), volume 59 of Leibniz International
Proceedings in Informatics, pages 25:1--25:14, Québec City, Canada,
August 2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.CONCUR.2016.25.
[ BibTex |
DOI |
Web page |
PDF ]
-
[AGK16]
-
S. Akshay, P. Gastin, and S. N. Krishna.
Analyzing Timed Systems Using Tree Automata.
In Proceedings of the 27th International Conference on
Concurrency Theory (CONCUR'16), volume 59 of Leibniz International
Proceedings in Informatics, pages 27:1--27:14, Québec City, Canada,
August 2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.CONCUR.2016.27.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BHL16b]
-
N. Bertrand, S. Haddad, and E. Lefaucheux.
Diagnosis in Infinite-State Probabilistic Systems.
In Proceedings of the 27th International Conference on
Concurrency Theory (CONCUR'16), volume 59 of Leibniz International
Proceedings in Informatics, pages 37:1--37:15, Québec City, Canada,
August 2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.CONCUR.2016.37.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DLM16]
-
A. David, F. Laroussinie, and N. Markey.
On the expressiveness of QCTL.
In Proceedings of the 27th International Conference on
Concurrency Theory (CONCUR'16), volume 59 of Leibniz International
Proceedings in Informatics, pages 28:1--28:15, Québec City, Canada,
August 2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.CONCUR.2016.28.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DFP16]
-
S. Demri, D. Figueira, and M. Praveen.
Reasoning about Data Repetitions with Counter Systems.
Logical Methods in Computer Science, 12(3):1:1--1:55, August 2016.
doi:
10.2168/LMCS-12(3:1)2016.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Gou16a]
-
J. Goubault-Larrecq.
A few things on Noetherian spaces.
Invited talk (plenary speaker), Summer Topology Conference,
Leicester, UK, August 2016.
[ BibTex ]
-
[Gou16b]
-
J. Goubault-Larrecq.
An introduction to asymmetric topology and domain theory: why,
what, and how.
Invited talk, Galway Symposium, Leicester, UK, August 2016.
[ BibTex ]
-
[Thi16]
-
F. Thiré.
Reverse engineering on arithmetic proofs.
Rapport de Master, Master Parisien de Recherche en
Informatique, Paris, France, August 2016.
26 pages.
[ BibTex |
Web page |
PDF ]
-
[BDJ+16]
-
Th. Brihaye, B. Delahaye, L. Jezequel, N. Markey, and J. Srba,
editors.
Proceedings of the Cassting Workshop on Games for the
Synthesis of Complex Systems (Cassting'16) and of the 3rd
International Workshop on Synthesis of Complex Parameters
(SynCoP'16), volume 220 of Electronic Proceedings in Theoretical
Computer Science, Eindhoven, The Netherlands, July 2016.
doi:
10.4204/EPTCS.220.
[ BibTex |
DOI |
Web page ]
-
[HT16d]
-
S. Haar and S. Theissing.
Predicting Traffic Load in Public Transportation Networks.
In Proceedings of the 35th American Control Conference
(ACC'16), pages 821--826, Boston, Massachusetts, USA, July 2016. IEEE
Control System Society.
doi:
10.1109/ACC.2016.7525015.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BBBC16]
-
N. Bertrand, P. Bouyer, Th. Brihaye, and
P. Carlier.
Analysing Decisive Stochastic Processes.
In Proceedings of the 43rd International Colloquium on
Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz
International Proceedings in Informatics, pages 101:1--101:14, Rome, Italy,
July 2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.ICALP.2016.101.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CH16]
-
D. Chistikov and C. Haase.
The Taming of the Semi-Linear Set.
In Proceedings of the 43rd International Colloquium on
Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz
International Proceedings in Informatics, pages 128:1--128:14, Rome, Italy,
July 2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.ICALP.2016.128.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Zet16]
-
G. Zetzsche.
The complexity of downward closure comparisons.
In Proceedings of the 43rd International Colloquium on
Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz
International Proceedings in Informatics, pages 123:1--123:14, Rome, Italy,
July 2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.ICALP.2016.123.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CD16b]
-
K. Chatterjee and L. Doyen.
Computation Tree Logic for Synchronization Properties.
In Proceedings of the 43rd International Colloquium on
Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz
International Proceedings in Informatics, pages 98:1--98:14, Rome, Italy,
July 2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.ICALP.2016.98.
[ BibTex |
DOI |
Web page |
PDF ]
-
[GS16]
-
J. Goubault-Larrecq and S. Schmitz.
Deciding Piecewise Testable Separability for Regular Tree
Languages.
In Proceedings of the 43rd International Colloquium on
Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz
International Proceedings in Informatics, pages 97:1--97:15, Rome, Italy,
July 2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.ICALP.2016.97.
[ BibTex |
DOI |
Web page ]
-
[GHLT16]
-
S. Göller, C. Haase, R. Lazić, and P. Totzke.
A Polynomial-Time Algorithm for Reachability in Branching VASS
in Dimension One.
In Proceedings of the 43rd International Colloquium on
Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz
International Proceedings in Informatics, pages 105:1--105:13, Rome, Italy,
July 2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.ICALP.2016.105.
[ BibTex |
DOI |
Web page ]
-
[BCM16]
-
P. Bouyer, M. Colange, and N. Markey.
Symbolic Optimal Reachability in Weighted Timed Automata.
In Proceedings of the 28th International Conference on
Computer Aided Verification (CAV'16) -- Part I, volume 9779 of
Lecture Notes in Computer Science, pages 513--530, Toronto, Canada, July
2016. Springer.
doi:
10.1007/978-3-319-41528-4_28.
[ BibTex |
DOI |
Web page ]
-
[BMR+16]
-
P. Bouyer, N. Markey, M. Randour, A. Sangnier, and D. Stan.
Reachability in Networks of Register Protocols under Stochastic
Schedulers.
In Proceedings of the 43rd International Colloquium on
Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz
International Proceedings in Informatics, pages 106:1--106:14, Rome, Italy,
July 2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.ICALP.2016.106.
[ BibTex |
DOI |
Web page ]
-
[LS16a]
-
R. Lazić and S. Schmitz.
The Complexity of Coverability in ν-Petri Nets.
In Proceedings of the 31st Annual ACM/IEEE Symposium on
Logic In Computer Science (LICS'16), pages 467--476, New York City,
USA, July 2016. ACM Press.
doi:
10.1145/2933575.2933593.
[ BibTex |
DOI |
Web page ]
-
[DBHS16]
-
A. Doumane, D. Baelde, L. Hirschi, and A. Saurin.
Towards Completeness via Proof Search in the Linear Time
μ-calculus.
In Proceedings of the 31st Annual ACM/IEEE Symposium on
Logic In Computer Science (LICS'16), pages 377--386, New York City,
USA, July 2016. ACM Press.
doi:
10.1145/2933575.2933598.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CG16]
-
Th. Colcombet and S. Göller.
Games with bound guess actions.
In Proceedings of the 31st Annual ACM/IEEE Symposium on
Logic In Computer Science (LICS'16), pages 257--266, New York City,
USA, July 2016. ACM Press.
doi:
10.1145/2933575.2934502.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CD16c]
-
K. Chatterjee and L. Doyen.
Perfect-information Stochastic Games with Generalized
Mean-Payoff Objectives.
In Proceedings of the 31st Annual ACM/IEEE Symposium on
Logic In Computer Science (LICS'16), pages 247--256, New York City,
USA, July 2016. ACM Press.
doi:
10.1145/2933575.2934513.
[ BibTex |
DOI |
Web page ]
-
[DMZ16]
-
E. D'Osualdo, R. Meyer, and G. Zetzsche.
First-order logic with reachability for infinite-state systems.
In Proceedings of the 31st Annual ACM/IEEE Symposium on
Logic In Computer Science (LICS'16), pages 457--466, New York City,
USA, July 2016. ACM Press.
doi:
10.1145/2933575.2934552.
[ BibTex |
DOI |
Web page |
PDF ]
-
[ACH+16]
-
M. F. Atig, D. Chistikov, P. Hofman, K. N. Kumar,
P. Saivasan, and G. Zetzsche.
Complexity of regular abstractions of one-counter languages.
In Proceedings of the 31st Annual ACM/IEEE Symposium on
Logic In Computer Science (LICS'16), pages 207--216, New York City,
USA, July 2016. ACM Press.
doi:
10.1145/2933575.2934561.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CFS16]
-
P. Chambart, A. Finkel, and S. Schmitz.
Forward Analysis and Model Checking for Trace Bounded WSTS.
Theoretical Computer Science, 637:1--29, July 2016.
doi:
10.1016/j.tcs.2016.04.020.
[ BibTex |
DOI |
Web page ]
-
[AMP16]
-
P. Arrighi, S. Martiel, and S. Perdrix.
Reversible Causal Graph Dynamics.
In 8th Conference on Reversible Computation (RC'16), volume 9720 of
Lecture Notes in Computer Science, pages 73--88, Bologna, Italy, July 2016.
Springer.
doi:
10.1007/978-3-319-40578-0_5.
[ BibTex |
DOI |
Web page ]
-
[PHL16]
-
H. Ponce de León, S. Haar, and D. Longuet.
Model-based Testing for Concurrent Systems: Unfolding-based Test
Selection.
International Journal on Software Tools for Technology Transfer,
18(3):305--318, June 2016.
doi:
10.1007/s10009-014-0353-y.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Sch16c]
-
S. Schmitz.
Implicational Relevance Logic is 2-ExpTime-Complete.
Journal of Symbolic Logic, 81(2):641--661, June 2016.
doi:
10.1017/jsl.2015.7.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DLV16]
-
A. Deutsch, Y. Li, and V. Vianu.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI
Symposium on Principles of Database Systems (PODS'16).
In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium
on Principles of Database Systems (PODS'16), pages 179--194, San
Francisco, California, USA, June 2016. ACM Press.
doi:
10.1145/2902251.2902275.
[ BibTex |
DOI ]
-
[Blo16]
-
M. Blondin.
Algorithmique et complexité des systèmes à
compteurs.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France and Université de Montréal, June
2016.
[ BibTex |
Web page ]
-
[PS16]
-
T. Place and L. Segoufin.
Decidable Characterization of FO2(<, +1) and locality of DA.
Research Report 1606.03217, Computing Research Repository, June 2016.
8 pages.
[ BibTex |
Web page |
PDF ]
-
[DG16a]
-
S. Delaune and I. Gazeau.
Combination issues.
Deliverable VIP 4.2 (ANR-11-JS02-0006), June 2016.
5 pages.
[ BibTex |
Web page |
PDF ]
-
[DG16b]
-
S. Delaune and I. Gazeau.
Results on the case studies.
Deliverable VIP 2.2 (ANR-11-JS02-0006), June 2016.
8 pages.
[ BibTex |
Web page |
PDF ]
-
[BBCM16]
-
P. Bouyer, Th. Brihaye, P. Carlier, and Q. Menet.
Compositional Design of Stochastic Timed Automata.
In Proceedings of the 11th International Computer Science
Symposium in Russia (CSR'16), volume 9691 of Lecture Notes in Computer
Science, pages 117--130, St Petersburg, Russia, June 2016. Springer.
doi:
10.1007/978-3-319-34171-2_9.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CC16]
-
J. Carmona and Th. Chatain.
Anti-Alignments in Conformance Checking -- The Dark Side of
Process Models.
In Proceedings of the 37th International Conference on
Applications and Theory of Petri Nets (PETRI NETS'16), volume 9698
of Lecture Notes in Computer Science, pages 240--258, Torún, Poland, June
2016. Springer.
doi:
10.1007/978-3-319-39086-4_15.
[ BibTex |
DOI |
Web page |
PDF ]
-
[KGH+16a]
-
F. Kordon, H. Garavel, L. M. Hillah, F. Hulin-Hubard,
G. Chiardo, A. Hamez, L. Jezequel, A. Miner, J. Meijer, E. Paviot-Adet,
D. Racordon, C. Rodriguez, C. Rohr, J. Srba, Y. Thierry-Mieg, G. Trinh,
and K. Wolf.
Complete Results for the 2016 Edition of the Model Checking
Contest, June 2016.
[ BibTex |
Web page ]
-
[Cau16a]
-
R. Cauderlier.
A Rewrite System for Proof Constructivization.
In Proceedings of the 11th International Workshop on Logical
Frameworks and Meta-Languages: Theory and Practice (LFMTP'16),
pages 2:1--2:7, Porto, Portugal, June 2016. ACM Press.
doi:
10.1007/978-3-319-40578-0_5.
[ BibTex |
DOI |
Web page |
PDF ]
-
[LBB+16]
-
A. Linard, B. Barbot, D. Buchs, M. Colange,
C. Démoulins, L. Hillah, and A. Martin.
Layered Data: A Modular Formal Definition without Formalisms.
In Proceedings of the 10th International Workshop on Petri
Nets and Software Engineering (PNSE'16), volume 1591 of CEUR Workshop
Proceedings, pages 287--306, Torun, Poland, June 2016. CEUR-WS.org.
[ BibTex |
Web page |
PDF ]
-
[BCEZ16]
-
T. Brough, L. Ciobanu, M. Elder, and G. Zetzsche.
Permutations of context-free, ET0L and indexed languages.
Discrete Mathematics & Theoretical Computer Science, 17(3):167--178,
May 2016.
[ BibTex |
Web page |
PDF ]
-
[HT16a]
-
S. Haar and S. Theissing.
A Passenger-centric Multi-agent System Model for Multimodal
Public Transportation.
Research Report hal-01322956, HAL-inria, May 2016.
12 pages.
[ BibTex |
Web page |
PDF ]
-
[FHLM16]
-
É. Fabre, L. Hélouët, E. Lefaucheux, and
H. Marchand.
Diagnosability of Repairable Faults.
In Proceedings of the 13th Workshop on Discrete Event
Systems (WODES'16), pages 230--236, Xi'an, China, May-June 2016. IEEE
Control System Society.
doi:
10.1109/WODES.2016.7497853.
[ BibTex |
DOI |
Web page |
PDF ]
-
[GR16]
-
G. Grefenstette and K. Rafes.
Transforming Wikipedia into an Ontology-based Information
Retrieval Search Engine for Local Experts using a Third-Party Taxonomy.
In Proceedings of the Joint 2nd Workshop on Language and
Ontology & Terminology and Knowledge Structures
(LangOnto+TermiKS'16), Portorož, Slovenia, May 2016.
To appear.
[ BibTex |
Web page |
PDF ]
-
[HBD16]
-
L. Hirschi, D. Baelde, and S. Delaune.
A method for verifying privacy-type properties: the unbounded
case.
In Proceedings of the 37th IEEE Symposium on Security and
Privacy (S&P'16), pages 564--581, San Jose, California, USA, May 2016.
IEEECSP.
doi:
10.1109/SP.2016.40.
[ BibTex |
DOI |
Web page |
PDF ]
-
[GLSHHM16]
-
J. Goubault-Larrecq, P.-A. Sentucq, F. Hulin-Hubard, and
F. Majorczyk.
Etat final des travaux engagés sur Orchids.
Rapport final et fourniture 4 du contrat DGA-INRIA Orchids, May 2016.
[ BibTex ]
-
[GLM16]
-
J. Goubault-Larrecq and F. Majorczyk.
Génération de signatures pour le suivi de flux
d'informations.
Fourniture 3 du contrat DGA-INRIA Orchids, May 2016.
[ BibTex ]
-
[HHK+16b]
-
M. Hutagalung, N. Hundeshagen, D. Kuske, M. Lange, and
É. Lozes.
Two-Buffer Simulation Games.
In Proceedings of the Cassting Workshop on Games for the
Synthesis of Complex Systems and 3rd International Workshop on
Synthesis of Complex Parameters (Cassting/SYNCOP'16), volume 220 of
Electronic Proceedings in Theoretical Computer Science, pages 213--227,
Eindhoven, The Netherlands, April 2016.
doi:
10.4204/EPTCS.220.3.
[ BibTex |
DOI |
Web page |
PDF ]
-
[HT16c]
-
S. Haar and S. Theissing.
Forecasting Passenger Loads in Transportation Networks.
In Proceedings of the 8th International Workshop on Practical
Applications of Stochastic Modelling (PASM'16), volume 327 of
Electronic Notes in Theoretical Computer Science, pages 49--69, Münster,
Germany, April 2016. Elsevier Science Publishers.
doi:
10.1016/j.entcs.2016.09.023.
[ BibTex |
DOI |
Web page |
PDF ]
-
[LACF16]
-
A. Le Coënt, J. Alexandre dit Sandretto,
A. Chapoutot, and L. Fribourg.
Control of Nonlinear Switched Systems Based on Validated
Simulation.
In Proceedings of the 2nd International Workshop on Symbolic
and Numerical Methods for Reachability Analysis (SNR'16), pages
1--6, Vienna, Austria, April 2016. IEEE Computer Society Press.
[ BibTex |
Web page |
PDF ]
-
[FGMP16]
-
L. Fribourg, É. Goubault, S. Mohamed, and S. Putot.
A Topological Method for Finding Invariant Sets of Switched
Systems.
In Proceedings of the 19th ACM International Conference on
Hybrid Systems: Computation and Control (HSCC'16), pages 61--70,
Vienna, Austria, April 2016. ACM Press.
doi:
10.1145/2883817.2883822.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CCH+16]
-
D. Chistikov, W. Czerwiński, P. Hofman, M. Pilipczuk, and
M. Wehar.
Shortest paths in one-counter systems.
In Proceedings of the 19th International Conference on
Foundations of Software Science and Computation Structures
(FoSSaCS'16), volume 9634 of Lecture Notes in Computer Science, pages
462--478, Eindhoven, The Netherlands, April 2016. Springer.
doi:
10.1007/978-3-662-49630-5_27.
[ BibTex |
DOI |
Web page |
PDF ]
-
[HLL+16]
-
P. Hofman, S. Lasota, R. Lazić, J. Leroux, S. Schmitz,
and P. Totzke.
Coverability Trees for Petri Nets with Unordered Data.
In Proceedings of the 19th International Conference on
Foundations of Software Science and Computation Structures
(FoSSaCS'16), volume 9634 of Lecture Notes in Computer Science, pages
445--461, Eindhoven, The Netherlands, April 2016. Springer.
doi:
10.1007/978-3-662-49630-5_26.
[ BibTex |
DOI |
Web page ]
-
[FG16]
-
M. Fortin and P. Gastin.
Verification of parameterized communicating automata via
split-width.
In Proceedings of the 19th International Conference on
Foundations of Software Science and Computation Structures
(FoSSaCS'16), volume 9634 of Lecture Notes in Computer Science, pages
197--213, Eindhoven, The Netherlands, April 2016. Springer.
doi:
10.1007/978-3-662-49630-5_12.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CDD16]
-
V. Cortier, A. Dallon, and S. Delaune.
Bounding the number of agents, for equivalence too.
In Proceedings of the 5th International Conference on
Principles of Security and Trust (POST'16), volume 9635 of Lecture
Notes in Computer Science, pages 211--232, Eindhoven, The Netherlands, April
2016. Springer.
doi:
10.1007/978-3-662-49635-0_11.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BFHH16a]
-
M. Blondin, A. Finkel, C. Haase, and S. Haddad.
Approaching the Coverability Problem Continuously.
In Proceedings of the 22th International Conference on Tools
and Algorithms for Construction and Analysis of Systems (TACAS'16),
volume 9636 of Lecture Notes in Computer Science, pages 480--496, Eindhoven,
The Netherlands, April 2016. Springer.
doi:
10.1007/978-3-662-49674-9_28.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BHJL16]
-
B. Bérard, S. Haddad, A. Jovanović, and D. Lime.
Interrupt Timed Automata with Auxiliary Clocks and Parameters.
Fundamenta Informaticae, 143(3-4):235--259, March 2016.
doi:
10.3233/FI-2016-1313.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BHL16a]
-
N. Bertrand, S. Haddad, and E. Lefaucheux.
Accurate Approximate Diagnosability of Stochastic Systems.
In Proceedings of the 10th International Conference on
Language and Automata Theory and Applications (LATA'16), volume
9618 of Lecture Notes in Computer Science, pages 549--561, Prague, Czech
Republic, March 2016. Springer.
doi:
10.1007/978-3-319-30000-9_42.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DD16a]
-
S. Demri and M. Deters.
Expressive Completeness of Separation Logic With Two Variables
and No Separating Conjunction.
ACM Transactions on Computational Logic, 17(2):12:1--12:44, March
2016.
doi:
10.1145/2835490.
[ BibTex |
DOI |
Web page |
PDF ]
-
[AD16a]
-
P. Arrighi and G. Dowek.
Free fall and cellular automata.
In Proceedings of the 11th International Workshop on
Developments in Computational Models (DCM'15), volume 204 of
Electronic Proceedings in Theoretical Computer Science, pages 1--10, Cali,
Colombia, March 2016.
doi:
10.4204/EPTCS.204.1.
[ BibTex |
DOI |
Web page ]
-
[BGM16]
-
P. Bouyer, P. Gardy, and N. Markey.
On the semantics of Strategy Logic.
Information Processing Letters, 116(2):75--79, February 2016.
doi:
10.1016/j.ipl.2015.10.004.
[ BibTex |
DOI |
Web page |
PDF ]
-
[HK16]
-
C. Haase and S. Kiefer.
The Complexity of the Kth Largest Subset Problem and Related
Problems.
Information Processing Letters, 116(2):111--115, February 2016.
doi:
10.1016/j.ipl.2015.09.015.
[ BibTex |
DOI |
Web page |
PDF ]
-
[LS16b]
-
J. Leroux and S. Schmitz.
Ideal Decompositions for Vector Addition Systems.
In Proceedings of the 33rd Annual Symposium on Theoretical
Aspects of Computer Science (STACS'16), volume 47 of Leibniz
International Proceedings in Informatics, pages 1:1--1:13, Orléans,
France, February 2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.STACS.2016.1.
[ BibTex |
DOI |
Web page ]
-
[Sch16b]
-
S. Schmitz.
Complexity Hierarchies Beyond Elementary.
ACM Transactions on Computation Theory, 8(1:3), February 2016.
doi:
10.1145/2858784.
[ BibTex |
DOI |
Web page ]
-
[HH16]
-
C. Haase and P. Hofman.
Tightening the Complexity of Equivalence Problems for
Commutative Grammars.
In Proceedings of the 33rd Annual Symposium on Theoretical
Aspects of Computer Science (STACS'16), volume 47 of Leibniz
International Proceedings in Informatics, pages 41:1--14, Orléans,
France, February 2016. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.STACS.2016.41.
[ BibTex |
DOI |
Web page |
PDF ]
-
[KNS16]
-
P. Karandikar, M. Niewerth, and Ph. Schnoebelen.
On the state complexity of closures and interiors of regular
languages with subwords and superwords.
Theoretical Computer Science, 610(A):91--107, January 2016.
doi:
10.1016/j.tcs.2015.09.028.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DD16b]
-
S. Demri and M. Deters.
Temporal Logics on Strings with Prefix Relation.
Journal of Logic and Computation, 26(3):989--1017, 2016.
doi:
10.1093/logcom/exv028.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BFHH16b]
-
M. Blondin, A. Finkel, C. Haase, and S. Haddad.
QCover: an efficient coverability verifier for discrete and
continuous Petri nets, 2016.
[ BibTex |
Web page ]
-
[DH16]
-
S. Delaune and L. Hirschi.
A survey of symbolic methods for establishing equivalence-based
properties in cryptographic protocols.
Journal of Logic and Algebraic Methods in Programming, 87:127--144,
2016.
To appear.
doi:
10.1016/j.jlamp.2016.10.005.
[ BibTex |
DOI |
Web page |
PDF ]
-
[JSD16]
-
F. Jacquemard, L. Segoufin, and J. Dimino.
FO2(<, +1,) on data trees, data tree automata
and branching vector addition systems.
Logical Methods in Computer Science, 12(2):1--28, 2016.
doi:
10.2168/LMCS-12(2:3)2016.
[ BibTex |
DOI |
Web page |
PDF ]
-
[GSSW16]
-
J. Goubault-Larrecq, M. Seisenberger, V. Selivanov, and
A. Weiermann.
Well Quasi-Orders in Computer Science (Dagstuhl
Seminar 16031).
Dagstuhl Reports, 6(1):69--98, January 2016.
doi:
10.4230/DagRep.6.1.69.
[ BibTex |
DOI |
Web page |
PDF ]
-
[KGH+16b]
-
F. Kordon, H. Garavel, L. Hillah, E. Paviot-Adet,
L. Jezequel, C. Rodríguez, and F. Hulin-Hubard.
MCC'2015 - The Fifth Model Checking Contest.
Transactions on Petri Nets and Other Models of Concurrency,
11:262--273, 2016.
doi:
10.1007/978-3-662-53401-4_12.
[ BibTex |
DOI |
Web page |
PDF ]
-
[ADF+16]
-
P. A. Abdulla, S. Demri, A. Finkel, J. Leroux, and
I. Potapov.
Selected papers of Reachability Problems Workshop 2012
(Bordeaux) and 2013 (Uppsala).
Fundamenta Informaticae, 143(3--4), 2016.
[ BibTex |
Web page ]
-
[LDR+16]
-
A. Le Coënt, F. De Vuyst, C. Rey, L. Chamoin, and
L. Fribourg.
Control of mechanical systems using set-based methods.
International Journal of Dynamics and Control, pages 1--17, 2016.
doi:
10.1007/s40435-016-0245-y.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DD16c]
-
A. Díaz-Caro and G. Dowek.
Quantum superpositions and projective measurement in the lambda
calculus.
Research Report 1601.04294, Computing Research Repository, January
2016.
22 pages.
[ BibTex |
Web page |
PDF ]
-
[Chr16]
-
R. Chrétien.
Analyse automatique de propriétés d'équivalence pour
les protocoles cryptographiques.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, January 2016.
[ BibTex |
Web page |
PDF ]
-
[Sch16a]
-
S. Schmitz.
Automata column: The complexity of reachability in vector
addition systems.
SIGLOG News, 3(1):3--21, January 2016.
doi:
10.1145/2893582.2893585.
[ BibTex |
DOI |
Web page ]
-
[HOW16]
-
C. Haase, J. Ouaknine, and J. Worrell.
Relating Reachability Problems in Timed and Counter Automata.
Fundamenta Informaticae, 143(3-4):317--338, January 2016.
doi:
10.3233/FI-2016-1316.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Gou16c]
-
J. Goubault-Larrecq.
Les méthodes formelles: l'autre arme de la
cybersécurité.
Encart dans l'article ”S'adapter à la cyberguerre”, de Karen
Elazari, Pour La Science 459, January 2016.
[ BibTex ]
-
[ADJL16a]
-
A. Assaf, G. Dowek, J.-P. Jouannaud, and J. Liu.
Encoding Proofs in Dedukti: the case of Coq proofs.
In Preliminary Proceedings of the 1st International Workshop on
Hammers for Type Theories (HaTT'16), Coimbra, Portugal, 2016.
[ BibTex |
Web page |
PDF ]
-
[ADJL16b]
-
A. Assaf, G. Dowek, J.-P. Jouannaud, and J. Liu.
Untyped Confluence in Dependent Type Theories.
In Proceedings of the 8th International Workshop on Higher-Order
Rewriting (HOR'16), Porto, Portugal, 2016.
[ BibTex |
Web page |
PDF ]
-
[ABC+16]
-
A. Assaf, G. Burel, R. Cauderlier, D. Delahaye, G. Dowek,
C. Dubois, F. Gilbert, P. Halmagrand, O. Hermant, and R. Saillard.
Expressing theories in the λΠ-calculus modulo
theory and in the Dedukti system.
In Proceedings of the 22nd International Conference on Types
for Proofs and Programs (TYPES'16), volume 97 of Leibniz International
Proceedings in Informatics, Novi Sad, Serbia, 2016. Leibniz-Zentrum für
Informatik.
To appear.
[ BibTex ]
-
[Dow16]
-
G. Dowek.
Rules and derivations in an elementary logic course.
preprint, January 2016.
[ BibTex |
Web page |
PDF ]
This file was generated by
bibtex2html 1.98.