Publications : 2010
-
[LAL10]
-
D. Longuet, M. Aiguier, and P. Le Gall.
Proof-guided test selection from first-order specifications with
equality.
Journal of Automated Reasoning, 45(4):437--473, December 2010.
doi:
10.1007/s10817-009-9128-7.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[BFHR10]
-
R. Bonnet, A. Finkel, S. Haddad, and F. Rosa-Velardo.
Comparing Petri Data Nets and Timed Petri Nets.
Research Report LSV-10-23, Laboratoire Spécification et
Vérification, ENS Cachan, France, December 2010.
16 pages.
[ BibTex |
Web page |
PDF ]
-
[Vac10]
-
C. Vacher.
Automates à contraintes globales pour la vérification de
propriétés de sécurité.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, December 2010.
[ BibTex |
Web page |
PDF ]
-
[Pla10]
-
Th. Place.
Decidable Characterizations for Tree Logics.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, December 2010.
[ BibTex |
Web page |
PDF ]
-
[Fig10b]
-
D. Figueira.
On decidable automata on data words and data trees in relation
to satisfiability of LTL and XPath.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, December 2010.
[ BibTex |
Web page |
PDF ]
-
[And10c]
-
É. André.
An Inverse Method for the Synthesis of Timing Parameters in
Concurrent Systems.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, December 2010.
[ BibTex |
Web page |
PDF ]
-
[Sou10b]
-
R. Soulat.
On Properties of the Inverse Method: Commutation of
Instanciation and Full Covering of the Behavioral Cartography.
Research Report LSV-10-22, Laboratoire Spécification et
Vérification, ENS Cachan, France, December 2010.
14 pages.
[ BibTex |
Web page |
PDF ]
-
[And10d]
-
É. André.
Synthesizing Parametric Constraints on Various Case Studies
Using IMITATOR II.
Research Report LSV-10-21, Laboratoire Spécification et
Vérification, ENS Cachan, France, December 2010.
66 pages.
[ BibTex |
Web page |
PDF ]
-
[DR10a]
-
S. Demri and A. Rabinovich.
The Complexity of Linear-time Temporal Logic over the Class of
Ordinals.
Logical Methods in Computer Science, 6(4), December 2010.
doi:
10.2168/LMCS-6(4:9)2010.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CSV10]
-
R. Chadha, A. P. Sistla, and M. Viswanathan.
Model Checking Concurrent Programs with Nondeterminism and
Randomization.
In Proceedings of the 30th Conference on Foundations of
Software Technology and Theoretical Computer Science (FSTTCS'10),
volume 8 of Leibniz International Proceedings in Informatics, pages 364--375,
Chennai, India, December 2010. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.FSTTCS.2010.364.
[ BibTex |
DOI |
Web page |
PDF ]
-
[AGMNK10]
-
S. Akshay, P. Gastin, M. Mukund, and K. Narayan Kumar.
Model checking time-constrained scenario-based specifications.
In Proceedings of the 30th Conference on Foundations of
Software Technology and Theoretical Computer Science (FSTTCS'10),
volume 8 of Leibniz International Proceedings in Informatics, pages 204--215,
Chennai, India, December 2010. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.FSTTCS.2010.204.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CDHR10]
-
K. Chatterjee, L. Doyen, Th. A. Henzinger, and J.-F.
Raskin.
Generalized Mean-payoff and Energy Games.
In Proceedings of the 30th Conference on Foundations of
Software Technology and Theoretical Computer Science (FSTTCS'10),
volume 8 of Leibniz International Proceedings in Informatics, pages 505--516,
Chennai, India, December 2010. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.FSTTCS.2010.505.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BFLZ10]
-
R. Bonnet, A. Finkel, J. Leroux, and M. Zeitoun.
Place-Boundedness for Vector Addition Systems with one
zero-test.
In Proceedings of the 30th Conference on Foundations of
Software Technology and Theoretical Computer Science (FSTTCS'10),
volume 8 of Leibniz International Proceedings in Informatics, pages 192--203,
Chennai, India, December 2010. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.FSTTCS.2010.192.
[ BibTex |
DOI |
Web page |
PDF ]
-
[HBM+10]
-
P. Hunter, P. Bouyer, N. Markey, J. Ouaknine, and
J. Worrell.
Computing rational radical sums in uniform TC^0.
In Proceedings of the 30th Conference on Foundations of
Software Technology and Theoretical Computer Science (FSTTCS'10),
volume 8 of Leibniz International Proceedings in Informatics, pages 308--316,
Chennai, India, December 2010. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.FSTTCS.2010.308.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DLM10]
-
A. Da Costa, F. Laroussinie, and N. Markey.
ATL with strategy contexts: Expressiveness and Model
Checking.
In Proceedings of the 30th Conference on Foundations of
Software Technology and Theoretical Computer Science (FSTTCS'10),
volume 8 of Leibniz International Proceedings in Informatics, pages 120--132,
Chennai, India, December 2010. Leibniz-Zentrum für Informatik.
doi:
10.4230/LIPIcs.FSTTCS.2010.120.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BLPS10]
-
P. Barceló, L. Libkin, A. Poggi, and C. Sirangelo.
XML with incomplete information.
Journal of the ACM, 58(1), December 2010.
doi:
10.1145/1870103.1870107.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DKS10]
-
S. Delaune, S. Kremer, and G. Steel.
Formal Analysis of PKCS#11 and Proprietary Extensions.
Journal of Computer Security, 18(6):1211--1245, November 2010.
doi:
10.3233/JCS-2009-0394.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Gou10b]
-
J. Goubault-Larrecq.
Finite Models for Formal Security Proofs.
Journal of Computer Security, 18(6):1247--1299, November 2010.
doi:
10.3233/JCS-2009-0395.
[ BibTex |
DOI |
Web page |
PDF ]
-
[KM10]
-
S. Kremer and L. Mazaré.
Computationally Sound Analysis of Protocols using Bilinear
Pairings.
Journal of Computer Security, 18(6):999--1033, November 2010.
doi:
10.3233/JCS-2009-0388.
[ BibTex |
DOI |
Web page |
PDF ]
-
[And10b]
-
É. André.
IMITATOR II User Manual.
Research Report LSV-10-20, Laboratoire Spécification et
Vérification, ENS Cachan, France, November 2010.
31 pages.
[ BibTex |
Web page |
PDF ]
-
[LMT10]
-
R. Lanotte, A. Maggiolo-Schettini, and A. Troina.
Weak bisimulation for Probabilistic Timed Automata?
Theoretical Computer Science, 411(50):4291--4322, November 2010.
doi:
10.1016/j.tcs.2010.09.003.
[ BibTex |
DOI |
Web page |
PDF ]
-
[AJRG10]
-
R. Abassi, F. Jacquemard, M. Rusinowitch, and S. Guemara
El Fatmi.
XML Access Control: from XACML to Annotated Schemas.
In Proceedings of the 2nd International Conference on
Communications and Networking (ComNet'10), Tozeur, Tunisia, November
2010. IEEE Computer Society Press.
doi:
10.1109/COMNET.2010.5699810.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BHB10]
-
S. S. Bauer, R. Hennicker, and M. Bidoit.
A Modal Interface Theory with Data Constraints.
In Revised Selected Papers of the 13th Brazilian Symposium
on Formal Methods (SBMF'10), volume 6527 of Lecture Notes in Computer
Science, pages 80--95. Springer, November 2010.
doi:
10.1007/978-3-642-19829-8_6.
[ BibTex |
DOI |
Web page |
PDF ]
-
[LBD+10]
-
S. Li, S. Balaguer, A. David, K. G. Larsen, B. Nielsen, and
S. Pusinskas.
Scenario-based verification of real-time systems using
Uppaal.
Formal Methods in System Design, 37(2-3):200--264, November 2010.
doi:
10.1007/s10703-010-0103-z.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BHSZ10]
-
B. Bérard, S. Haddad, M. Sassolas, and M. Zeitoun.
Distributed Synthesis with Incomparable Information.
Research Report LSV-10-17, Laboratoire Spécification et
Vérification, ENS Cachan, France, October 2010.
20 pages.
[ BibTex |
Web page |
PDF ]
-
[CD10a]
-
K. Chatterjee and L. Doyen.
The Complexity of Partial-Observation Parity Games.
In Proceedings of the 17th International Conference on Logic
for Programming, Artificial Intelligence, and Reasoning (LPAR'10),
volume 6397 of Lecture Notes in Artificial Intelligence, pages 1--14,
Yogyakarta, Indonesia, October 2010. Springer.
doi:
10.1007/978-3-642-16242-8_1.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[KBBB10]
-
U. Kühne, S. Beyer, J. Bormann, and J. Barstow.
Automated Formal Verification of Processors Based on
Architectural Models.
In Proceedings of the 10th International Conference on Formal
Methods in Computer Aided Design (FMCAD'10), pages 129--136,
Lugano, Switzerland, October 2010. IEEE Computer Society Press.
[ BibTex |
Web page |
PDF ]
-
[BCFS10]
-
M. Bortolozzo, M. Centenaro, R. Focardi, and G. Steel.
Attacking and Fixing PKCS#11 Security Tokens.
In Proceedings of the 17th ACM Conference on Computer and
Communications Security (CCS'10), pages 260--269, Chicago, Illinois,
USA, October 2010. ACM Press.
doi:
10.1145/1866307.1866337.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Haa10a]
-
S. Haar.
Types of Asynchronous Diagnosability and the
phReveals-Relation in Occurrence Nets.
IEEE Transactions on Automatic Control, 55(10):2310--2320, October
2010.
doi:
10.1109/TAC.2010.2063490.
[ BibTex |
DOI |
Web page |
PDF ]
-
[SRKK10]
-
B. Smyth, M. D. Ryan, S. Kremer, and M. Kourjieh.
Towards automatic analysis of election verifiability
properties.
In Proceedings of the Joint Workshop on Automated Reasoning
for Security Protocol Analysis and Issues in the Theory of
Security (ARSPA-WITS'10), volume 6186 of Lecture Notes in Computer
Science, pages 146--163, Paphos, Cyprus, October 2010. Springer.
doi:
10.1007/978-3-642-16074-5_11.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BCHK10]
-
P. Baldan, Th. Chatain, S. Haar, and B. König.
Unfolding-based Diagnosis of Systems with an Evolving Topology.
Information and Computation, 208(10):1169--1192, October 2010.
doi:
10.1016/j.ic.2009.11.009.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BK10]
-
D. Berwanger and L. Kaiser.
Information Tracking in Games on Graphs.
Journal of Logic, Language and Information, 19(4):395--412, October
2010.
doi:
10.1007/s10849-009-9115-8.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BCD+10]
-
D. Berwanger, K. Chatterjee, L. Doyen, M. De Wulf, and
Th. A. Henzinger.
Strategy Construction for Parity Games with Imperfect
Information.
Information and Computation, 208(10):1206--1220, October 2010.
doi:
10.1016/j.ic.2009.09.006.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[BS10]
-
M. Bojańczyk and L. Segoufin.
Tree Languages Defined in First-Order Logic with One Quantifier
Alternation.
Logical Methods in Computer Science, 6(4:1), October 2010.
doi:
10.2168/LMCS-6(4:1)2010.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Rod10]
-
C. Rodríguez.
Implementation of a complete prefix unfolder for contextual
nets.
Rapport de Master, Master Parisien de Recherche en
Informatique, Paris, France, September 2010.
[ BibTex |
Web page |
PDF ]
-
[HMY10b]
-
S. Haddad, L. Mokdad, and S. Youcef.
Selection of the Best composite Web Service Based on Quality of
Service.
In Proceedings of the 2nd International Symposium on Services
Science and 3rd International Conference on Business Process and
Services Computing (ISSSashBPSC'10), volume 177 of Lecture Notes
in Informatics, pages 255--266, Leipzig, Germany, September-October 2010.
Gesellschaft für Informatik.
[ BibTex |
Web page |
PDF ]
-
[Sce10]
-
G. Scerri.
Modélisation des clés de l'intrus.
Rapport de Master, Master Parisien de Recherche en
Informatique, Paris, France, September 2010.
[ BibTex ]
-
[CDH10a]
-
K. Chatterjee, L. Doyen, and Th. A. Henzinger.
Expressiveness and Closure Properties for Quantitative
Languages.
Logical Methods in Computer Science, 6(3:10), September 2010.
doi:
10.2168/LMCS-6(3:10)2010.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[BGGP10]
-
O. Bouissou, É. Goubault, J. Goubault-Larrecq, and
S. Putot.
A Generalization of P-boxes to Affine Arithmetic, and
Applications to Static Analysis of Programs.
In Proceedings of the 14th GAMM-IMACS International
Symposium on Scientific Computing, Computer Arithmetic and
Validated Numerics (SCAN'10), Lyon, France, September 2010.
[ BibTex ]
-
[Dem10a]
-
S. Demri.
Counter Systems for Data Logics.
In Proceedings of the 12th European Conference on Logics in
Artificial Intelligence (JELIA'10), volume 6431 of Lecture Notes in
Artificial Intelligence, page 10, Helsinki, Finland, September 2010.
Springer.
doi:
10.1007/978-3-642-15675-5_3.
[ BibTex |
DOI |
Web page |
PDF ]
-
[MW10]
-
N. Markey and J. Wijsen, editors.
Proceedings of the 17th International Symposium on
Temporal Representation and Reasoning (TIME'10), Paris, France,
September 2010. IEEE Computer Society Press.
doi:
10.1109/TIME.2010.4.
[ BibTex |
DOI |
Web page ]
-
[DKRS10a]
-
S. Delaune, S. Kremer, M. D. Ryan, and G. Steel.
A Formal Analysis of Authentication in the TPM.
In Revised Selected Papers of the 7th International
Workshop on Formal Aspects in Security and Trust (FAST'10),
volume 6561 of Lecture Notes in Computer Science, pages 111--125, Pisa,
Italy, September 2010. Springer.
doi:
10.1007/978-3-642-19751-2_8.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[BWA10]
-
M. Baudet, B. Warinschi, and M. Abadi.
Guessing Attacks and the Computational Soundness of Static
Equivalence.
Journal of Computer Security, 18(5):909--968, September 2010.
doi:
10.3233/JCS-2009-0386.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BG10]
-
H. Benzina and J. Goubault-Larrecq.
Some Ideas on Virtualized Systems Security, and Monitors.
In Revised Selected Papers of the 5th International
Workshop on Data Privacy Management and Autonomous Spontaneous
Security (DPM'10) and 3rd International Workshop on Autonomous and
Spontaneous Security (SETOP'10), volume 6514 of Lecture Notes in
Computer Science, pages 244--258, Athens, Greece, September 2010. Springer.
doi:
10.1007/978-3-642-19348-4_18.
[ BibTex |
DOI |
Web page |
PDF ]
-
[LV10]
-
É. Lozes and J. Villard.
A spatial equational logic for the applied π-calculus.
Distributed Computing, 23(1):61--83, September 2010.
doi:
10.1007/s00446-010-0112-6.
[ BibTex |
DOI |
Web page |
PDF ]
-
[And10a]
-
É. André.
IMITATOR II: A Tool for Solving the Good Parameters Problem in
Timed Automata.
In Proceedings of the 12th International Workshops on
Verification of Infinite State Systems (INFINITY'10), volume 39 of
Electronic Proceedings in Theoretical Computer Science, pages 91--99,
Singapore, September 2010.
doi:
10.4204/EPTCS.39.7.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Dem10b]
-
S. Demri.
On Selective Unboundedness of VASS.
In Proceedings of the 12th International Workshops on
Verification of Infinite State Systems (INFINITY'10), volume 39 of
Electronic Proceedings in Theoretical Computer Science, pages 1--15,
Singapore, September 2010.
doi:
10.4204/EPTCS.39.1.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BDF10]
-
A. Bušić, H. Djafri, and J.-M. Fourneau.
Stochastic Bounds for Censored Markov Chains.
In Proceedings of the 6th International Meeting on the
Numerical Solution of Markov Chain (NSMC'10), Williamsburg,
Virginia, USA, September 2010.
[ BibTex |
Web page |
PDF ]
-
[KRS10]
-
S. Kremer, M. D. Ryan, and B. Smyth.
Election verifiability in electronic voting protocols.
In Proceedings of the 15th European Symposium on Research in
Computer Security (ESORICS'10), volume 6345 of Lecture Notes in
Computer Science, pages 389--404, Athens, Greece, September 2010. Springer.
doi:
10.1007/978-3-642-15497-3_24.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DDS10a]
-
M. Dahl, S. Delaune, and G. Steel.
Formal Analysis of Privacy for Vehicular Mix-Zones.
In Proceedings of the 15th European Symposium on Research in
Computer Security (ESORICS'10), volume 6345 of Lecture Notes in
Computer Science, pages 55--70, Athens, Greece, September 2010. Springer.
doi:
10.1007/978-3-642-15497-3_4.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[BBM10a]
-
P. Bouyer, R. Brenguier, and N. Markey.
Computing Equilibria in Two-Player Timed Games
via Turn-Based Finite Games.
In Proceedings of the 8th International Conference on Formal
Modelling and Analysis of Timed Systems (FORMATS'10), volume 6246
of Lecture Notes in Computer Science, pages 62--76, Vienna, Austria,
September 2010. Springer.
doi:
10.1007/978-3-642-15297-9_7.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BCH10]
-
S. Balaguer, Th. Chatain, and S. Haar.
A Concurrency-Preserving Translation from Time Petri Nets to
Networks of Timed Automata.
In Proceedings of the 17th International Symposium on
Temporal Representation and Reasoning (TIME'10), pages 77--84, Paris,
France, September 2010. IEEE Computer Society Press.
doi:
10.1109/TIME.2010.12.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BHS10]
-
B. Bérard, S. Haddad, and M. Sassolas.
Real Time Properties for Interrupt Timed Automata.
In Proceedings of the 17th International Symposium on
Temporal Representation and Reasoning (TIME'10), pages 69--76, Paris,
France, September 2010. IEEE Computer Society Press.
doi:
10.1109/TIME.2010.11.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BKM10]
-
B. Bollig, D. Kuske, and I. Meinecke.
Propositional Dynamic Logic for Message-Passing Systems.
Logical Methods in Computer Science, 6(3:16), September 2010.
doi:
10.2168/LMCS-6(3:16)2010.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DL10]
-
S. Demri and D. Lugiez.
Complexity of Modal Logics with Presburger Constraints.
Journal of Applied Logic, 8(3):233--252, September 2010.
doi:
10.1016/j.jal.2010.03.001.
[ BibTex |
DOI |
Web page |
PDF ]
-
[San10]
-
O. Sankur.
Model-checking robuste des automates temporisés via
les machines à canaux.
Rapport de Master, Master Parisien de Recherche en
Informatique, Paris, France, September 2010.
[ BibTex |
Web page |
PDF ]
-
[Sou10a]
-
R. Soulat.
Améliorations algorithmiques d'un moteur de model-checking
et études de cas.
Rapport de Master, Master 2 Recherche Informatique Paris
Sud 11, September 2010.
[ BibTex |
Web page |
PDF ]
-
[Boi10]
-
A. Boiret.
Grammaires context-free pour les arbres sans rang.
Rapport de Master, Master Parisien de Recherche en
Informatique, Paris, France, September 2010.
[ BibTex |
Web page |
PDF ]
-
[Dim10]
-
J. Dimino.
Sur les arbres de rang non borné avec données.
Rapport de Master, Master Parisien de Recherche en
Informatique, Paris, France, September 2010.
[ BibTex |
Web page |
PDF ]
-
[Mon10]
-
B. Monmege.
Propriétés quantitatives des mots et des arbres --
Applications aux langages XML.
Rapport de Master, Master Parisien de Recherche en
Informatique, Paris, France, September 2010.
[ BibTex |
Web page |
PDF ]
-
[ABMG10]
-
S. Abiteboul, P. Bourhis, B. Marinoiu, and A. Galland.
AXART -- Enabling Collaborative Work with AXML Artifacts.
In Proceedings of the 36th International Conference on Very
Large Data Bases (VLDB'10), volume 3 of Proceedings of the VLDB
Endowment, pages 1553--1556, Singapore, September 2010. ACM Press.
[ BibTex |
Web page |
PDF ]
-
[BBC+10a]
-
P. Baldan, A. Bruni, A. Corradini, B. König, and
S. Schwoon.
On the Computation of McMillan's Prefix for Contextual Nets
and Graph Grammars.
In Proceedings of the 5th International Conference on Graph
Transformations (ICGT'10), volume 6372 of Lecture Notes in Computer
Science, pages 91--106, Enschede, The Netherlands, September-October 2010.
Springer.
doi:
10.1007/978-3-642-15928-2_7.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Cyr10b]
-
A. Cyriac.
Temporal Logics for Concurrent Recursive Programs.
Rapport de Master, Master Parisien de Recherche en
Informatique, Paris, France, September 2010.
[ BibTex |
Web page |
PDF ]
-
[Haa10b]
-
S. Haar.
What Topology Tells us about Diagnosability in Partial Order
Semantics.
In Proceedings of the 10th Workshop on Discrete Event
Systems (WODES'10), pages 221--226, Berlin, Germany, August-September
2010. IFAC.
[ BibTex |
Web page |
PDF ]
-
[GL10]
-
P. Gastin and F. Laroussinie, editors.
Proceedings of the 21st International Conference on
Concurrency Theory (CONCUR'10), volume 6269 of Lecture Notes in
Computer Science. Springer, August-September 2010.
doi:
10.1007/978-3-642-15375-4.
[ BibTex |
DOI |
Web page ]
-
[FHL10]
-
D. Figueira, P. Hofman, and S. Lasota.
Relating timed and register automata.
In Proceedings of the 17th International Workshop on
Expressiveness in Concurrency (EXPRESS'10), volume 41 of Electronic
Proceedings in Theoretical Computer Science, pages 61--75, Paris, France,
August 2010.
doi:
10.4204/EPTCS.41.5.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DKRS10b]
-
S. Delaune, S. Kremer, M. D. Ryan, and G. Steel.
A Formal Analysis of Authentication in the TPM (short paper).
In Preliminary Proceedings of the 8th International Workshop
on Security Issues in Coordination Models, Languages and Systems
(SecCo'10), Paris, France, August 2010.
[ BibTex |
Web page |
PS |
PDF ]
-
[Sch10c]
-
Ph. Schnoebelen.
Lossy Counter Machines Decidability Cheat Sheet.
In Proceedings of the 4th Workshop on Reachability Problems
in Computational Models (RP'10), volume 6227 of Lecture Notes in
Computer Science, pages 51--75, Brno, Czech Republic, August 2010. Springer.
doi:
10.1007/978-3-642-15349-5_4.
[ BibTex |
DOI |
Web page |
PDF ]
-
[AF10a]
-
É. André and L. Fribourg.
Behavioral Cartography of Timed Automata.
In Proceedings of the 4th Workshop on Reachability Problems
in Computational Models (RP'10), volume 6227 of Lecture Notes in
Computer Science, pages 76--90, Brno, Czech Republic, August 2010. Springer.
doi:
10.1007/978-3-642-15349-5_5.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DDG+10]
-
A. Degorre, L. Doyen, R. Gentilini, J.-F. Raskin, and
S. Toruńczyk.
Energy and Mean-Payoff Games with Imperfect Information.
In Proceedings of the 19th Annual EACSL Conference on
Computer Science Logic (CSL'10), volume 6247 of Lecture Notes in
Computer Science, pages 260--274, Brno, Czech Republic, August 2010.
Springer.
doi:
10.1007/978-3-642-15205-4_22.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Sch10d]
-
Ph. Schnoebelen.
Revisiting Ackermann-Hardness for Lossy Counter Machines and
Reset Petri Nets.
In Proceedings of the 35th International Symposium on
Mathematical Foundations of Computer Science (MFCS'10), volume 6281
of Lecture Notes in Computer Science, pages 616--628, Brno, Czech Republic,
August 2010. Springer.
doi:
10.1007/978-3-642-15155-2_54.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CDGH10]
-
K. Chatterjee, L. Doyen, H. Gimbert, and Th. A.
Henzinger.
Randomness for Free.
In Proceedings of the 35th International Symposium on
Mathematical Foundations of Computer Science (MFCS'10), volume 6281
of Lecture Notes in Computer Science, pages 246--257, Brno, Czech Republic,
August 2010. Springer.
doi:
10.1007/978-3-642-15155-2_23.
[ BibTex |
DOI |
Web page |
PDF ]
-
[FP10]
-
G. Fontaine and Th. Place.
Classes of trees definable in the μ-calculus.
In Proceedings of the 35th International Symposium on
Mathematical Foundations of Computer Science (MFCS'10), volume 6281
of Lecture Notes in Computer Science, pages 381--392, Brno, Czech Republic,
August 2010. Springer.
doi:
10.1007/978-3-642-15155-2_34.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CDH10b]
-
K. Chatterjee, L. Doyen, and Th. A. Henzinger.
Qualitative Analysis of Partially-observable Markov Decision
Processes.
In Proceedings of the 35th International Symposium on
Mathematical Foundations of Computer Science (MFCS'10), volume 6281
of Lecture Notes in Computer Science, pages 258--269, Brno, Czech Republic,
August 2010. Springer.
doi:
10.1007/978-3-642-15155-2_24.
[ BibTex |
DOI |
Web page |
PDF ]
-
[OU10]
-
J. Olschewski and M. Ummels.
The Complexity of Finding Reset Words in Finite Automata.
In Proceedings of the 35th International Symposium on
Mathematical Foundations of Computer Science (MFCS'10), volume 6281
of Lecture Notes in Computer Science, pages 568--579, Brno, Czech Republic,
August 2010. Springer.
doi:
10.1007/978-3-642-15155-2_50.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CDE+10]
-
K. Chatterjee, L. Doyen, H. Edelsbrunner, Th. A.
Henzinger, and P. Rannou.
Mean-Payoff Automaton Expressions.
In Proceedings of the 21st International Conference on
Concurrency Theory (CONCUR'10), volume 6269 of Lecture Notes in
Computer Science, pages 269--283, Paris, France, August-September 2010.
Springer.
doi:
10.1007/978-3-642-15375-4_19.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BBM10b]
-
P. Bouyer, R. Brenguier, and N. Markey.
Nash Equilibria for Reachability Objectives in Multi-player
Timed Games.
In Proceedings of the 21st International Conference on
Concurrency Theory (CONCUR'10), volume 6269 of Lecture Notes in
Computer Science, pages 192--206, Paris, France, August-September 2010.
Springer.
doi:
10.1007/978-3-642-15375-4_14.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CS10a]
-
P. Chambart and Ph. Schnoebelen.
Computing blocker sets for the Regular Post Embedding
Problem.
In Proceedings of the 14th International Conference on
Developments in Language Theory (DLT'10), volume 6224 of Lecture
Notes in Computer Science, pages 136--147, London, Ontario, Canada, August
2010. Springer.
doi:
10.1007/978-3-642-14455-4_14.
[ BibTex |
DOI |
Web page |
PDF ]
-
[HNS10]
-
P.-C. Héam, C. Nicaud, and S. Schmitz.
Parametric Random Generation of Deterministic Tree Automata.
Theoretical Computer Science, 411(38-39):3469--3480, August 2010.
doi:
10.1016/j.tcs.2010.05.036.
[ BibTex |
DOI |
Web page |
PDF ]
-
[JR10]
-
F. Jacquemard and M. Rusinowitch.
Rewrite-based verification of XML updates.
In Proceedings of the 12th International ACM SIGPLAN
Conference on Principles and Practice of Declarative Programming
(PPDP'10), pages 119--130, Hagenberg, Austria, July 2010. ACM Press.
doi:
10.1145/1836089.1836105.
[ BibTex |
DOI |
Web page |
PDF ]
-
[NSV10]
-
A. Nash, L. Segoufin, and V. Vianu.
Views and queries: Determinacy and rewriting.
ACM Transactions on Database Systems, 35(3), July 2010.
doi:
10.1145/1806907.1806913.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Car10]
-
J.-L. Carré.
Analyse statique de programmes multi-thread pour
l'embarqué.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, July 2010.
[ BibTex |
Web page |
PDF ]
-
[Aks10]
-
S. Akshay.
Spécification et vérification pour des systèmes
distribués et temporisés.
Thèse de doctorat, Laboratoire Spécification et
Vérification, ENS Cachan, France, July 2010.
[ BibTex |
Web page |
PDF ]
-
[DDS10b]
-
M. Dahl, S. Delaune, and G. Steel.
Formal Analysis of Privacy for Vehicular Mix-Zones.
In Proceedings of the Workshop on Foundations of Security and
Privacy (FCS-PrivMod'10), pages 55--70, Edinburgh, Scotland, UK, July
2010.
doi:
10.1007/978-3-642-15497-3_4.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[Sch10b]
-
S. Schmitz.
On the Computational Complexity of Dominance Links in
Grammatical Formalisms.
In Proceedings of the 48th Annual Meeting of the Association
for Computational Linguistics (ACL'10), pages 514--524, Uppsala,
Sweden, July 2010. Association for Computational Linguistics.
[ BibTex |
Web page |
PDF ]
-
[CCD10]
-
V. Cheval, H. Comon-Lundh, and S. Delaune.
Automating security analysis: symbolic equivalence of constraint
systems.
In Proceedings of the 5th International Joint Conference on
Automated Reasoning (IJCAR'10), volume 6173 of Lecture Notes in
Artificial Intelligence, pages 412--426, Edinburgh, Scotland, UK, July 2010.
Springer-Verlag.
doi:
10.1007/978-3-642-14203-1_35.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Gou10c]
-
J. Goubault-Larrecq.
Noetherian Spaces in Verification.
In Proceedings of the 37th International Colloquium on
Automata, Languages and Programming (ICALP'10) -- Part II, volume
6199 of Lecture Notes in Computer Science, pages 2--21, Bordeaux, France,
July 2010. Springer.
doi:
10.1007/978-3-642-14162-1_2.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CS10b]
-
P. Chambart and Ph. Schnoebelen.
Pumping and Counting on the Regular Post Embedding Problem.
In Proceedings of the 37th International Colloquium on
Automata, Languages and Programming (ICALP'10) -- Part II, volume
6199 of Lecture Notes in Computer Science, pages 64--75, Bordeaux, France,
July 2010. Springer.
doi:
10.1007/978-3-642-14162-1_6.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CD10b]
-
K. Chatterjee and L. Doyen.
Energy Parity Games.
In Proceedings of the 37th International Colloquium on
Automata, Languages and Programming (ICALP'10) -- Part II, volume
6199 of Lecture Notes in Computer Science, pages 599--610, Bordeaux, France,
July 2010. Springer.
doi:
10.1007/978-3-642-14162-1_50.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BGMZ10]
-
B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun.
Pebble weighted automata and transitive closure logics.
In Proceedings of the 37th International Colloquium on
Automata, Languages and Programming (ICALP'10) -- Part II, volume
6199 of Lecture Notes in Computer Science, pages 587--598, Bordeaux, France,
July 2010. Springer.
doi:
10.1007/978-3-642-14162-1_49.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CC10]
-
S. Ciobâcă and V. Cortier.
Protocol composition for arbitrary primitives.
In Proceedings of the 23rd IEEE Computer Security
Foundations Symposium (CSF'10), pages 322--336, Edinburgh, Scotland,
UK, July 2010. IEEE Computer Society Press.
doi:
10.1109/CSF.2010.29.
[ BibTex |
DOI |
Web page |
PDF ]
-
[ACD10]
-
M. Arnaud, V. Cortier, and S. Delaune.
Modeling and Verifying Ad Hoc Routing Protocols.
In Proceedings of the 23rd IEEE Computer Security
Foundations Symposium (CSF'10), pages 59--74, Edinburgh, Scotland, UK,
July 2010. IEEE Computer Society Press.
doi:
10.1109/CSF.2010.12.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BKK+10]
-
B. Bollig, J.-P. Katoen, C. Kern, M. Leucker, D. Neider, and
D. R. Piegdon.
libalf: the Automata Learning Framework.
In Proceedings of the 22nd International Conference on
Computer Aided Verification (CAV'10), volume 6174 of Lecture Notes in
Computer Science, pages 360--364, Edinburgh, Scotland, UK, July 2010.
Springer.
doi:
10.1007/978-3-642-14295-6_32.
[ BibTex |
DOI |
Web page |
PDF ]
-
[SS10]
-
N. Schweikardt and L. Segoufin.
Addition-invariant FO and regularity.
In Proceedings of the 25th Annual IEEE Symposium on Logic
in Computer Science (LICS'10), pages 273--282, Edinburgh, Scotland, UK,
July 2010. IEEE Computer Society Press.
doi:
10.1109/LICS.2010.16.
[ BibTex |
DOI |
Web page |
PDF ]
-
[PS10]
-
Th. Place and L. Segoufin.
Deciding definability in FO_2(<) on trees.
In Proceedings of the 25th Annual IEEE Symposium on Logic
in Computer Science (LICS'10), pages 253--262, Edinburgh, Scotland, UK,
July 2010. IEEE Computer Society Press.
doi:
10.1109/LICS.2010.17.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Gou10d]
-
J. Goubault-Larrecq.
ωQRB-Domains and the
Probabilistic Powerdomain.
In Proceedings of the 25th Annual IEEE Symposium on Logic
in Computer Science (LICS'10), pages 352--361, Edinburgh, Scotland, UK,
July 2010. IEEE Computer Society Press.
doi:
10.1109/LICS.2010.50.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BCG+10]
-
L. Barguñó, C. Creus, G. Godoy, F. Jacquemard, and
C. Vacher.
The Emptiness Problem for Tree Automata with Global
Constraints.
In Proceedings of the 25th Annual IEEE Symposium on Logic
in Computer Science (LICS'10), pages 263--272, Edinburgh, Scotland, UK,
July 2010. IEEE Computer Society Press.
doi:
10.1109/LICS.2010.28.
[ BibTex |
DOI |
Web page |
PDF ]
-
[GK10]
-
P. Gastin and D. Kuske.
Uniform satisfiability problem for local temporal logics over
Mazurkiewicz traces.
Information and Computation, 208(7):797--816, July 2010.
doi:
10.1016/j.ic.2009.12.003.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Cyr10a]
-
A. Cyriac.
A New Version of Focus Games for LTL Satisfiability.
In Proceedings of the Workshop on Comparing Logical
Decision Methods (CLoDeM'10), Edinburgh, Scotland, UK, July 2010.
[ BibTex |
Web page |
PDF ]
-
[BJL+10]
-
Th. Brihaye, M. Jungers, S. Lasaulce, N. Markey, and
G. Oreiby.
Using Model Checking for Analyzing Distributed Power Control
Problems.
EURASIP Journal on Wireless Communications and Networking,
2010(861472), June 2010.
doi:
10.1155/2010/861472.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DHLN10]
-
L. Doyen, Th. A. Henzinger, A. Legay, and
D. Nickovic.
Robustness of Sequential Circuits.
In Proceedings of the 10th International Conference on
Application of Concurrency to System Design (ACSD'10), pages
77--84, Braga, Portugal, June 2010. IEEE Computer Society Press.
doi:
10.1109/ACSD.2010.26.
[ BibTex |
DOI |
Web page |
PDF ]
-
[EHH10]
-
D. El Hog-Benzina, S. Haddad, and R. Hennicker.
Process Refinement and Asynchronous Composition with
Modalities.
In Proceedings of the 2nd International Workshop on
Abstractions for Petri Nets and Other Models of Concurrency
(APNOC'10), Braga, Portugal, June 2010.
[ BibTex |
Web page |
PDF ]
-
[HMY10a]
-
S. Haddad, L. Mokdad, and S. Youcef.
Response time of BPEL4WS constructors.
In Proceedings of the 15th IEEE Symposium on Computers and
Communications (ISCC'10), pages 695--700, Riccione, Italy, June 2010.
IEEE Computer Society Press.
doi:
10.1109/ISCC.2010.5546538.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CF10]
-
Th. Chatain and É. Fabre.
Factorization Properties of Symbolic Unfoldings of Colored
Petri Nets.
In Proceedings of the 31st International Conference on
Applications and Theory of Petri Nets (PETRI NETS'10), volume 6128
of Lecture Notes in Computer Science, pages 165--184, Braga, Portugal, June
2010. Springer.
doi:
10.1007/978-3-642-13675-7_11.
[ BibTex |
DOI |
Web page |
PDF ]
-
[LS10b]
-
L. Libkin and C. Sirangelo.
Reasoning about XML with temporal logics and automata.
Journal of Applied Logic, 8(2):210--232, June 2010.
doi:
10.1016/j.jal.2009.09.005.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BH10b]
-
B. Bollig and L. Hélouët.
Realizability of Dynamic MSC Languages.
In Proceedings of the 5th International Computer Science
Symposium in Russia (CSR'10), volume 6072 of Lecture Notes in Computer
Science, pages 48--59, Kazan, Russia, June 2010. Springer.
doi:
10.1007/978-3-642-13182-0_5.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BKKL10a]
-
B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker.
Learning Communicating Automata from MSCs.
IEEE Transactions on Software Engineering, 36(3):390--408, May-June
2010.
doi:
10.1109/TSE.2009.89.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CJ10]
-
Th. Chatain and C. Jard.
Sémantique concurrente symbolique des réseaux de Petri
saufs et dépliages finis des réseaux temporels.
In Actes de la 10ème Conférence Internationale sur les
NOuvelles TEchnologies de la RÉpartition (NOTERE'10), Tozeur,
Tunisia, May-June 2010. IEEE Computer Society Press.
[ BibTex |
Web page |
PDF ]
-
[DKR10b]
-
S. Delaune, S. Kremer, and M. D. Ryan.
Verifying Privacy-Type Properties of Electronic Voting
Protocols: A Taster.
In Towards Trustworthy Elections -- New Directions in
Electronic Voting, volume 6000 of Lecture Notes in Computer Science,
pages 289--309. Springer, May 2010.
doi:
10.1007/978-3-642-12980-3_18.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DLS10]
-
S. Demri, R. Lazić, and A. Sangnier.
Model checking memoryful linear-time logics over one-counter
automata.
Theoretical Computer Science, 411(22-24):2298--2316, May 2010.
doi:
10.1016/j.tcs.2010.02.021.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BFLM10]
-
P. Bouyer, U. Fahrenberg, K. G. Larsen, and N. Markey.
Timed Automata with Observers under Energy Constraints.
In Proceedings of the 13th International Conference on Hybrid
Systems: Computation and Control (HSCC'10), pages 61--70, Stockholm,
Sweden, April 2010. ACM Press.
doi:
10.1145/1755952.1755963.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Gou10a]
-
J. Goubault-Larrecq.
De Groot Duality and Models of Choice: Angels, Demons, and
Nature.
Mathematical Structures in Computer Science, 20(2):169--237, April
2010.
doi:
10.1017/S0960129509990363.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CKW10]
-
V. Cortier, S. Kremer, and B. Warinschi.
A Survey of Symbolic Methods in Computational Analysis of
Cryptographic Systems.
Journal of Automated Reasoning, 46(3-4):225--259, April 2010.
doi:
10.1007/s10817-010-9187-9.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BH10a]
-
M. Ben Hmida and S. Haddad.
Client Synthesis for Aspect Oriented Web Services.
In Revised Selected Papers of the 15th Monterey Workshop on
Foundations of Computer Software (MONTEREY'08), volume 6028 of
Lecture Notes in Computer Science, pages 24--42, Budapest, Hungary, April
2010. Springer.
doi:
10.1007/978-3-642-12566-9_2.
[ BibTex |
DOI |
Web page |
PDF ]
-
[RHS10]
-
L. Recalde, S. Haddad, and M. Silva.
Continuous Petri Nets: Expressive Power and Decidability
Issues.
International Journal of Foundations of Computer Science,
21(2):235--256, April 2010.
doi:
10.1142/S0129054110007222.
[ BibTex |
DOI ]
-
[VLC10]
-
J. Villard, É. Lozes, and C. Calcagno.
Tracking Heaps that Hop with Heap-Hop.
In Proceedings of the 16th International Conference on Tools
and Algorithms for Construction and Analysis of Systems (TACAS'10),
volume 6015 of Lecture Notes in Computer Science, pages 275--279, Paphos,
Cyprus, March 2010. Springer.
doi:
10.1007/978-3-642-12002-2_23.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DS10]
-
S. Demri and A. Sangnier.
When Model-Checking Freeze LTL over Counter Machines Becomes
Decidable.
In Proceedings of the 13th International Conference on
Foundations of Software Science and Computation Structures
(FoSSaCS'10), volume 6014 of Lecture Notes in Computer Science, pages
176--190, Paphos, Cyprus, March 2010. Springer.
doi:
10.1007/978-3-642-12032-9_13.
[ BibTex |
DOI |
Web page |
PDF ]
-
[tCF10]
-
B. ten Cate and G. Fontaine.
An Easy Completeness Proof for the Modal μ-Calculus on
Finite Trees.
In Proceedings of the 13th International Conference on
Foundations of Software Science and Computation Structures
(FoSSaCS'10), volume 6014 of Lecture Notes in Computer Science, pages
161--175, Paphos, Cyprus, March 2010. Springer.
doi:
10.1007/978-3-642-12032-9_12.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CS10c]
-
P. Chambart and Ph. Schnoebelen.
Toward a compositional theory of leftist grammars and
transformations.
In Proceedings of the 13th International Conference on
Foundations of Software Science and Computation Structures
(FoSSaCS'10), volume 6014 of Lecture Notes in Computer Science, pages
237--251, Paphos, Cyprus, March 2010. Springer.
doi:
10.1007/978-3-642-12032-9_17.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DKR10a]
-
S. Delaune, S. Kremer, and M. D. Ryan.
Symbolic bisimulation for the applied pi calculus.
Journal of Computer Security, 18(2):317--377, March 2010.
doi:
10.3233/JCS-2010-0363.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Bon10]
-
R. Bonnet.
Well-structured Petri-nets extensions with data.
Rapport de Master, Master Computer Science, EPFL, Lausanne,
Switzerland, March 2010.
[ BibTex |
Web page |
PDF ]
-
[tCS10]
-
B. ten Cate and L. Segoufin.
Transitive Closure Logic, Nested Tree Walking Automata, and
XPath.
Journal of the ACM, 57(3), March 2010.
doi:
10.1145/1706591.1706598.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Seg10]
-
L. Segoufin, editor.
Proceedings of the 13th International Conference on
Database Theory (ICDT'10), March 2010.
[ BibTex |
Web page ]
-
[ACK+10]
-
S. Abiteboul, T.-H. H. Chan, E. Kharlamov, W. Nutt, and
P. Senellart.
Aggregate queries for discrete and continuous
probabilistic XML.
In Proceedings of the 13th International Conference on
Database Theory (ICDT'10), pages 50--61, Lausanne, Switzerland, March
2010. ACM Press.
doi:
10.1145/1804669.1804679.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Fig10a]
-
D. Figueira.
Forward-XPath and extended register automata on data-trees.
In Proceedings of the 13th International Conference on
Database Theory (ICDT'10), pages 230--240, Lausanne, Switzerland, March
2010. ACM Press.
doi:
10.1145/1804669.1804699.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[DR10b]
-
L. Doyen and J.-F. Raskin.
Antichains Algorithms for Finite Automata.
In Proceedings of the 16th International Conference on Tools
and Algorithms for Construction and Analysis of Systems (TACAS'10),
volume 6015 of Lecture Notes in Computer Science, pages 2--22, Paphos,
Cyprus, March 2010. Springer.
doi:
10.1007/978-3-642-12002-2_2.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[BCM10]
-
P. Bouyer, F. Chevalier, and N. Markey.
On the Expressiveness of TPTL and MTL.
Information and Computation, 208(2):97--116, February 2010.
doi:
10.1016/j.ic.2009.10.004.
[ BibTex |
DOI |
Web page |
PDF ]
-
[AHL+10]
-
A. Antonik, M. Huth, K. G. Larsen, U. Nyman, and
A. Wąsowski.
Modal and mixed specifications: key decision problems and their
complexities.
Mathematical Structures in Computer Science, 10(1):75--103, February
2010.
doi:
10.1017/S0960129509990260.
[ BibTex |
DOI |
Web page |
PDF ]
-
[GAMS10]
-
A. Galland, S. Abiteboul, A. Marian, and P. Senellart.
Corroborating information from disagreeing views.
In Proceedings of the 3rd International Conference on Web
Search and Web Data Mining (WSDM'10), pages 131--140, New York,
New York, USA, February 2010. ACM Press.
doi:
10.1145/1718487.1718504.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Sch10a]
-
S. Schmitz.
An Experimental Ambiguity Detection Tool.
Science of Computer Programming, 75(1-2):71--84, January 2010.
doi:
10.1016/j.scico.2009.07.002.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CLPV10]
-
R. Chadha, A. Legay, P. Prabhakar, and M. Viswanathan.
Complexity bounds for the verification of real-time software.
In Proceedings of the 11th International Conference on
Verification, Model Checking and Abstract Interpretation
(VMCAI'10), volume 5944 of Lecture Notes in Computer Science, pages
95--111, Madrid, Spain, January 2010. Springer.
doi:
10.1007/978-3-642-11319-2_10.
[ BibTex |
DOI |
Web page |
PDF ]
-
[BBC10b]
-
P. Bouyer, Th. Brihaye, and F. Chevalier.
O-Minimal Hybrid Reachability Games.
Logical Methods in Computer Science, 6(1:1), January 2010.
doi:
10.2168/LMCS-6(1:1)2010.
[ BibTex |
DOI |
Web page |
PDF ]
-
[FS10]
-
A. Finkel and A. Sangnier.
Mixing coverability and reachability to analyze VASS with one
zero-test.
In Proceedings of the 36th International Conference on Current
Trends in Theory and Practice of Computer Science (SOFSEM'10), volume 5901
of Lecture Notes in Computer Science, pages 394--406, Špindlerův
Mlýn, Czech Republic, January 2010. Springer.
doi:
10.1007/978-3-642-11266-9_33.
[ BibTex |
DOI |
Web page |
PS |
PDF ]
-
[BKKL10b]
-
B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker.
SMA---The Smyle Modeling Approach.
Computing and Informatics, 29(1):45--72, 2010.
[ BibTex |
Web page |
PDF ]
-
[ZBH10]
-
M. Zargayouna, F. Balbo, and S. Haddad.
Agents Secure Interaction in Data Driven Languages.
In Revised Selected Papers of the 2nd Workshop on
LAnguages, methodologies and Development tools for multi-agent systemS
(LADS'09), volume 6039 of Lecture Notes in Computer Science, pages 72--91,
Turin, Italy, 2010. Springer.
doi:
10.1007/978-3-642-13338-1_5.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CCZ10]
-
H. Comon-Lundh, V. Cortier, and E. Zălinescu.
Deciding security properties for cryptographic protocols.
Application to key cycles.
ACM Transactions on Computational Logic, 11(2), January 2010.
doi:
10.1145/1656242.1656244.
[ BibTex |
DOI |
Web page |
PDF ]
-
[AF10b]
-
P. Arnoux and A. Finkel.
Using mental imagery processes for teaching and research in
mathematics and computer science.
International Journal of Mathematical Education in Science and
Technology, 41(2):229--242, January 2010.
doi:
10.1080/00207390903372429.
[ BibTex |
DOI |
Web page |
PDF ]
-
[Ber10]
-
D. Berwanger.
Infinite Coordination Games.
In Logic and the Foundations of Game and Decision Theory (LOFT8),
volume 6006 of Lecture Notes in Artificial Intelligence, pages 1--19.
Springer, 2010.
doi:
10.1007/978-3-642-15164-4_1.
[ BibTex |
DOI |
Web page |
PDF ]
-
[CDH10c]
-
K. Chatterjee, L. Doyen, and Th. A. Henzinger.
Quantitative Languages.
ACM Transactions on Computational Logic, 11(4), 2010.
[ BibTex |
Web page |
PS |
PDF ]
-
[MLRS10]
-
N. Markey, S. Li, J.-F. Raskin, and M. Stoelinga.
Synthesizing controllers with bounded resources.
Deliverable QUASIMODO 3.4 (ICT-FP7-STREP-214755), January 2010.
[ BibTex ]
-
[LS10a]
-
L. Libkin and C. Sirangelo.
Disjoint pattern matching and implication in strings.
Information Processing Letters, 110(4):143--147, January 2010.
doi:
10.1016/j.ipl.2009.11.009.
[ BibTex |
DOI |
Web page |
PDF ]
-
[DFGvD10]
-
S. Demri, A. Finkel, V. Goranko, and G. van Drimmelen.
Model-checking CTL^* over Flat Presburger
Counter Systems.
Journal of Applied Non-Classical Logics, 20(4):313--344, 2010.
doi:
10.3166/jancl.20.313-344.
[ BibTex |
DOI |
Web page |
PDF ]
This file was generated by
bibtex2html 1.98.