Pedro Adão, Paulo Mateus, Tiago Reis & Luca Viganò (2006):
Towards a Quantitative Analysis of Security Protocols.
Electronic Notes in Theoretical Computer Science 164(3),
pp. 3–25,
doi:10.1016/j.entcs.2006.07.009.
Proceedings of the 4th Workshop on Quantitative Aspects of Programming Languages (QAPL 2006).
Gul Agha, José Meseguer & Koushik Sen (2006):
PMaude: Rewrite-based Specification Language for Probabilistic Object Systems.
Electronic Notes in Theoretical Computer Science 153(2),
pp. 213–239,
doi:10.1016/j.entcs.2005.10.040.
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005).
Elvira Albert, Puri Arenas, Samir Genaim, German Puebla & Damiano Zanardini (2012):
Cost analysis of object-oriented bytecode programs.
Theoretical Computer Science 413(1),
pp. 142–159,
doi:10.1016/j.tcs.2011.07.009.
Quantitative Aspects of Programming Languages (QAPL 2010).
Alessandro Aldini (2012):
Approximating Markovian testing equivalence.
Theoretical Computer Science 413(1),
pp. 73–86,
doi:10.1016/j.tcs.2011.07.019.
Quantitative Aspects of Programming Languages (QAPL 2010).
Alessandro Aldini & Marco Bernardo (2007):
Mixing logics and rewards for the component-oriented specification of performance measures.
Theor. Comput. Sci. 382(1),
pp. 3–23,
doi:10.1016/j.tcs.2007.05.006.
Quantitative Aspects of Programming Languages.
Alessandro Aldini & Marco Bernardo (2015):
Expected-Delay-Summing Weak Bisimilarity for Markov Automata.
In: Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 194,
pp. 1–15,
doi:10.4204/EPTCS.194.1.
Alessandro Aldini & Alessandra Di Pierro (2005):
On Quantitative Analysis of Probabilistic Protocols.
Electronic Notes in Theoretical Computer Science 112,
pp. 131–148,
doi:10.1016/j.entcs.2004.01.019.
Proceedings of the Second Workshop on Quantitative Aspects of Programming Languages (QAPL 2004).
María Alpuente, María-del-Mar Gallardo, Ernesto Pimentel & Alicia Villanueva (2005):
A semantic framework for the abstract model checking of tccp programs.
Theor. Comput. Sci. 346(1),
pp. 58–95,
doi:10.1016/j.tcs.2005.08.009.
Quantitative Aspects of Programming Languages.
Karine Altisen, Yanhong Liu & Matthieu Moy (2010):
Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata.
In: Proceedings Eighth Workshop on Quantitative Aspects of Programming Languages,
Electronic Proceedings in Theoretical Computer Science 28,
pp. 16–33,
doi:10.4204/EPTCS.28.2.
Bogdan Aman & Gabriel Ciobanu (2011):
Time Delays in Membrane Systems and Petri Nets.
In: Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages,
Electronic Proceedings in Theoretical Computer Science 57,
pp. 47–60,
doi:10.4204/EPTCS.57.4.
Suzana Andova, Sonja Georgievska & Nikola Trčka (2012):
Branching bisimulation congruence for probabilistic systems.
Theoretical Computer Science 413(1),
pp. 58–72,
doi:10.1016/j.tcs.2011.07.020.
Quantitative Aspects of Programming Languages (QAPL 2010).
Aleksandr Andreychenko, Pepijn Crouzen, Linar Mikeev & Verena Wolf (2011):
On-the-fly Uniformization of Time-Inhomogeneous Infinite Markov Population Models.
In: Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages,
Electronic Proceedings in Theoretical Computer Science 57,
pp. 1–15,
doi:10.4204/EPTCS.57.1.
Ashok Argent-Katwala & Jeremy T. Bradley (2007):
PEPA Queues: Capturing Customer Behaviour in Queueing Networks.
Electronic Notes in Theoretical Computer Science 190(3),
pp. 3–25,
doi:10.1016/j.entcs.2007.07.002.
Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages (QAPL 2007).
Arjun Arul & Julien Reichert (2013):
The Complexity of Robot Games on the Integer Line.
In: Proceedings 11th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 117,
pp. 132–148,
doi:10.4204/EPTCS.117.9.
Joseph Assouramou & Josée Desharnais (2011):
Analysis of Non-Linear Probabilistic Hybrid Systems.
In: Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages,
Electronic Proceedings in Theoretical Computer Science 57,
pp. 104–119,
doi:10.4204/EPTCS.57.8.
Christel Baier, Pedro D'Argenio & Marcus Groesser (2006):
Partial Order Reduction for Probabilistic Branching Time.
Electronic Notes in Theoretical Computer Science 153(2),
pp. 97–116,
doi:10.1016/j.entcs.2005.10.034.
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005).
Steffen van Bakel, Ikra Khan, Maria Grazia Vigliotti & John K. Heath (2008):
Modelling Intracellular Fate of FGF Receptors With BioAmbients.
Electronic Notes in Theoretical Computer Science 220(3),
pp. 181–197,
doi:10.1016/j.entcs.2008.11.026.
Proceedings of the Sixth Workshop on Quantitative Aspects of Programming Languages (QAPL 2008).
Pedro Baltazar, Paulo Mateus, Rajagopal Nagarajan & Nikolaos Papanikolaou (2007):
Exogenous Probabilistic Computation Tree Logic.
Electronic Notes in Theoretical Computer Science 190(3),
pp. 95–110,
doi:10.1016/j.entcs.2007.07.007.
Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages (QAPL 2007).
Gilles Barthe, Tamara Rezk & Martijn Warnier (2006):
Preventing Timing Leaks Through Transactional Branching Instructions.
Electronic Notes in Theoretical Computer Science 153(2),
pp. 33–55,
doi:10.1016/j.entcs.2005.10.031.
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005).
Mohammad-Mahdi Bazm, Marc Lacoste, Mario Südholt & Jean-Marc Menaud (2019):
Isolation in cloud computing infrastructures: new security challenges.
Annales des Telecommunications/Annals of Telecommunications 74(3-4),
pp. 197–209,
doi:10.1007/s12243-019-00703-z.
Francesco Belardinelli, Pavel Gonzalez & Alessio Lomuscio (2012):
Automated Verification of Quantum Protocols using MCMAS.
In: Proceedings 10th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 85,
pp. 48–62,
doi:10.4204/EPTCS.85.4.
Marco Bernardo (2009):
Uniform Logical Characterizations of Testing Equivalences for Nondeterministic, Probabilistic and Markovian Processes.
Electronic Notes in Theoretical Computer Science 253(3),
pp. 3–23,
doi:10.1016/j.entcs.2009.10.002.
Proceedings of Seventh Workshop on Quantitative Aspects of Programming Languages (QAPL 2009).
Marco Bernardo (2012):
Weak Markovian Bisimulation Congruences and Exact CTMC-Level Aggregations for Concurrent Processes.
In: Proceedings 10th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 85,
pp. 122–136,
doi:10.4204/EPTCS.85.9.
Marco Bernardo, Rocco De Nicola & Michele Loreti (2013):
The Spectrum of Strong Behavioral Equivalences for Nondeterministic and Probabilistic Processes.
In: Proceedings 11th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 117,
pp. 81–96,
doi:10.4204/EPTCS.117.6.
Nathalie Bertrand & Philippe Schnoebelen (2013):
Solving Stochastic Büchi Games on Infinite Arenas with a Finite Attractor.
In: Proceedings 11th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 117,
pp. 116–131,
doi:10.4204/EPTCS.117.8.
Alessandro Bianco, Marco Faella, Fabio Mogavero & Aniello Murano (2012):
Quantitatively fair scheduling.
Theoretical Computer Science 413(1),
pp. 160–175,
doi:10.1016/j.tcs.2011.06.029.
Quantitative Aspects of Programming Languages (QAPL 2010).
Stefano Bistarelli, Ugo Montanari, Francesca Rossi & Francesco Santini (2007):
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming.
Electronic Notes in Theoretical Computer Science 190(3),
pp. 111–127,
doi:10.1016/j.entcs.2007.07.008.
Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages (QAPL 2007).
Chiara Bodei, Michele Curti, Pierpaolo Degano, Mikael Buchholtz, Flemming Nielson, Hanne Riis Nielson & Corrado Priami (2005):
Performance Evaluation of Security Protocols Specified in LySa.
Electronic Notes in Theoretical Computer Science 112,
pp. 167–189,
doi:10.1016/j.entcs.2004.01.017.
Proceedings of the Second Workshop on Quantitative Aspects of Programming Languages (QAPL 2004).
Luca Bortolussi (2006):
Stochastic Concurrent Constraint Programming.
Electronic Notes in Theoretical Computer Science 164(3),
pp. 65–80,
doi:10.1016/j.entcs.2006.07.012.
Proceedings of the 4th Workshop on Quantitative Aspects of Programming Languages (QAPL 2006).
Luca Bortolussi (2008):
On the Approximation of Stochastic Concurrent Constraint Programming by Master Equation.
Electronic Notes in Theoretical Computer Science 220(3),
pp. 163–180,
doi:10.1016/j.entcs.2008.11.025.
Proceedings of the Sixth Workshop on Quantitative Aspects of Programming Languages (QAPL 2008).
Luca Bortolussi, Rocco De Nicola, Vashti Galpin, Stephen Gilmore, Jane Hillston, Diego Latella, Michele Loreti & Mieke Massink (2015):
CARMA: Collective Adaptive Resource-sharing Markovian Agents.
In: Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 194,
pp. 16–31,
doi:10.4204/EPTCS.194.2.
Luca Bortolussi, Vashti Galpin & Jane Hillston (2011):
HYPE with stochastic events.
In: Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages,
Electronic Proceedings in Theoretical Computer Science 57,
pp. 120–133,
doi:10.4204/EPTCS.57.9.
Luca Bortolussi, Vashti Galpin & Jane Hillston (2012):
Hybrid performance modelling of opportunistic networks.
In: Proceedings 10th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 85,
pp. 106–121,
doi:10.4204/EPTCS.85.8.
Luca Bortolussi & Jane Hillston (2015):
Efficient Checking of Individual Rewards Properties in Markov Population Models.
In: Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 194,
pp. 32–47,
doi:10.4204/EPTCS.194.3.
Luca Bortolussi & Alberto Policriti (2007):
Stochastic Concurrent Constraint Programming and Differential Equations.
Electronic Notes in Theoretical Computer Science 190(3),
pp. 27–42,
doi:10.1016/j.entcs.2007.07.003.
Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages (QAPL 2007).
Luca Bortolussi & Maria Grazia Vigliotti (2009):
CoBiC: Context-dependent Bioambient Calculus.
Electronic Notes in Theoretical Computer Science 253(3),
pp. 187–201,
doi:10.1016/j.entcs.2009.10.012.
Proceedings of Seventh Workshop on Quantitative Aspects of Programming Languages (QAPL 2009).
Bettina Braitling, Luis María Ferrer Fioriti, Hassan Hatefi, Ralf Wimmer, Bernd Becker & Holger Hermanns (2014):
MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata.
In: Proceedings Twelfth Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 154,
pp. 48–63,
doi:10.4204/EPTCS.154.4.
Mario Bravetti, Roberto Gorrieri, Roberto Lucchi & Gianluigi Zavattaro (2005):
Quantitative information in the tuple space coordination model.
Theor. Comput. Sci. 346(1),
pp. 28–57,
doi:10.1016/j.tcs.2005.08.004.
Antonio Brogi, Alessandra Di Pierro & Herbert Wiklicky (2002):
Linear Embedding for a Quantitative Comparison of Language Expressiveness.
Electronic Notes in Theoretical Computer Science 59(3),
pp. 207–237,
doi:10.1016/S1571-0661(04)00289-0.
QAPL'01, Quantitative Aspects of Programming Languages.
Peter Bulychev, Alexandre David, Kim Gulstrand Larsen, Marius Mikučionis, Danny Bøgsted Poulsen, Axel Legay & Zheng Wang (2012):
UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata.
In: Proceedings 10th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 85,
pp. 1–16,
doi:10.4204/EPTCS.85.1.
David Cachera & Arnaud Jobin (2010):
Injecting Abstract Interpretations into Linear Cost Models.
In: Proceedings Eighth Workshop on Quantitative Aspects of Programming Languages,
Electronic Proceedings in Theoretical Computer Science 28,
pp. 64–81,
doi:10.4204/EPTCS.28.5.
Luca Cardelli, Mirco Tribastone, Max Tschaikowski & Andrea Vandin (2017):
ERODE: A Tool for the Evaluation and Reduction of Ordinary Differential Equations.
In: Axel Legay & Tiziana Margaria: Tools and Algorithms for the Construction and Analysis of Systems.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
pp. 310–328,
doi:10.1007/978-3-662-54580-5_19.
Valentina Castiglioni, Daniel Gebler & Simone Tini (2016):
Logical Characterization of Bisimulation Metrics.
In: Proceedings 14th Workshop Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 227,
pp. 44–62,
doi:10.4204/EPTCS.227.4.
Valentina Castiglioni & Simone Tini (2017):
Logical Characterization of Trace Metrics.
In: Proceedings 15th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 250,
pp. 39–74,
doi:10.4204/EPTCS.250.4.
Pavol Černý, Thomas A. Henzinger & Arjun Radhakrishna (2012):
Simulation distances.
Theoretical Computer Science 413(1),
pp. 21–35,
doi:10.1016/j.tcs.2011.08.002.
Quantitative Aspects of Programming Languages (QAPL 2010).
Tom Chothia, Jun Pang & Mohammad Torabi Dashti (2007):
Keeping Secrets in Resource Aware Components.
Electronic Notes in Theoretical Computer Science 190(3),
pp. 79–94,
doi:10.1016/j.entcs.2007.07.006.
Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages (QAPL 2007).
Vincenzo Ciancia & Gian Luigi Ferrari (2007):
Co-Algebraic Models for Quantitative Spatial Logics.
Electronic Notes in Theoretical Computer Science 190(3),
pp. 43–58,
doi:10.1016/j.entcs.2007.07.004.
Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages (QAPL 2007).
Gabriel Ciobanu & Cristian Prisacariu (2006):
Timers for Distributed Systems.
Electronic Notes in Theoretical Computer Science 164(3),
pp. 81–99,
doi:10.1016/j.entcs.2006.07.013.
Proceedings of the 4th Workshop on Quantitative Aspects of Programming Languages (QAPL 2006).
David Clark, Sebastian Hunt & Pasquale Malacaria (2002):
Quantitative Analysis of the Leakage of Confidential Data.
Electronic Notes in Theoretical Computer Science 59(3),
pp. 238–251,
doi:10.1016/S1571-0661(04)00290-7.
QAPL'01, Quantitative Aspects of Programming Languages.
David Clark, Sebastian Hunt & Pasquale Malacaria (2005):
Quantified Interference for a While Language.
Electronic Notes in Theoretical Computer Science 112,
pp. 149–166,
doi:10.1016/j.entcs.2004.01.018.
Proceedings of the Second Workshop on Quantitative Aspects of Programming Languages (QAPL 2004).
Mario Coppo, Ferruccio Damiani, Maurizio Drocco, Elena Grassi & Angelo Troina (2010):
Stochastic Calculus of Wrapped Compartments.
In: Proceedings Eighth Workshop on Quantitative Aspects of Programming Languages,
Electronic Proceedings in Theoretical Computer Science 28,
pp. 82–98,
doi:10.4204/EPTCS.28.6.
Elise Cormie-Bowins & Franck van Breugel (2012):
Measuring Progress of Probabilistic LTL Model Checking.
In: Proceedings 10th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 85,
pp. 33–47,
doi:10.4204/EPTCS.85.3.
Rocco De Nicola, Joost-Pieter Katoen, Diego Latella, Michele Loreti & Mieke Massink (2007):
Model checking mobile stochastic logic.
Theoretical Computer Science 382(1),
pp. 42–70,
doi:10.1016/j.tcs.2007.05.008.
Quantitative Aspects of Programming Languages.
Rocco De Nicola, Joost-Pieter Katoen, Diego Latella & Mieke Massink (2006):
Towards a Logic for Performance and Mobility.
Electronic Notes in Theoretical Computer Science 153(2),
pp. 161–175,
doi:10.1016/j.entcs.2005.10.037.
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005).
Pierpaolo Degano, Davide Prandi, Corrado Priami & Paola Quaglia (2006):
Beta-binders for Biological Quantitative Experiments.
Electronic Notes in Theoretical Computer Science 164(3),
pp. 101–117,
doi:10.1016/j.entcs.2006.07.014.
Proceedings of the 4th Workshop on Quantitative Aspects of Programming Languages (QAPL 2006).
Yuxin Deng, Tom Chothia, Catuscia Palamidessi & Jun Pang (2006):
Metrics for Action-labelled Quantitative Transition Systems.
Electronic Notes in Theoretical Computer Science 153(2),
pp. 79–96,
doi:10.1016/j.entcs.2005.10.033.
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005).
Yuxin Deng & Wenjie Du (2007):
Probabilistic Barbed Congruence.
Electronic Notes in Theoretical Computer Science 190(3),
pp. 185–203,
doi:10.1016/j.entcs.2007.07.011.
Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages (QAPL 2007).
Yuxin Deng & Wenjie Du (2009):
The Kantorovich Metric in Computer Science: A Brief Survey.
Electronic Notes in Theoretical Computer Science 253(3),
pp. 73–82,
doi:10.1016/j.entcs.2009.10.006.
Proceedings of Seventh Workshop on Quantitative Aspects of Programming Languages (QAPL 2009).
Yuxin Deng, Rob van Glabbeek, Matthew Hennessy & Carroll Morgan (2014):
Real-reward testing for probabilistic processes.
Theoretical Computer Science 538,
pp. 16–36,
doi:10.1016/j.tcs.2013.07.016.
Quantitative Aspects of Programming Languages and Systems (2011-12).
Alessandra Di Pierro, Chris Hankin & Herbert Wiklicky (2002):
Approximate Non-Interference.
In: 15th IEEE Workshop on Computer Security Foundations,
pp. 3–17,
doi:10.1109/CSFW.2002.1021803.
Alessandra Di Pierro, Chris Hankin & Herbert Wiklicky (2007):
On Probabilistic Techniques for Data Flow Analysis.
Electronic Notes in Theoretical Computer Science 190(3),
pp. 59–77,
doi:10.1016/j.entcs.2007.07.005.
Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages (QAPL 2007).
Alessandra Di Pierro, Pascal Sotin & Herbert Wiklicky (2008):
Relational Analysis and Precision via Probabilistic Abstract Interpretation.
Electronic Notes in Theoretical Computer Science 220(3),
pp. 23–42,
doi:10.1016/j.entcs.2008.11.017.
Proceedings of the Sixth Workshop on Quantitative Aspects of Programming Languages (QAPL 2008).
Alessandra Di Pierro & Herbert Wiklicky (2000):
Concurrent constraint programming: towards probabilistic abstract interpretation.
In: Proceedings of the 2nd ACM SIGPLAN conference on on Principles and Practice of Declarative Programming,
pp. 127–138,
doi:10.1145/351268.351284.
Klaus Dräger, Marta Kwiatkowska, David Parker & Hongyang Qu (2014):
Local abstraction refinement for probabilistic timed programs.
Theoretical Computer Science 538,
pp. 37–53,
doi:10.1016/j.tcs.2013.07.013.
Quantitative Aspects of Programming Languages and Systems (2011-12).
Marco Faella, Axel Legay & Marielle Stoelinga (2008):
Model Checking Quantitative Linear Time Logic.
Electronic Notes in Theoretical Computer Science 220(3),
pp. 61–77,
doi:10.1016/j.entcs.2008.11.019.
Proceedings of the Sixth Workshop on Quantitative Aspects of Programming Languages (QAPL 2008).
Uli Fahrenberg & Axel Legay (2014):
The quantitative linear-time–branching-time spectrum.
Theoretical Computer Science 538,
pp. 54–69,
doi:10.1016/j.tcs.2013.07.030.
Quantitative Aspects of Programming Languages and Systems (2011-12).
Uli Fahrenberg, Claus Thrane & Kim G. Larsen (2011):
Distances for Weighted Transition Systems: Games and Properties.
In: Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages,
Electronic Proceedings in Theoretical Computer Science 57,
pp. 134–147,
doi:10.4204/EPTCS.57.10.
Cheng Feng (2014):
Patch-based Hybrid Modelling of Spatially Distributed Systems by Using Stochastic HYPE - ZebraNet as an Example.
In: Proceedings Twelfth Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 154,
pp. 64–77,
doi:10.4204/EPTCS.154.5.
Thom Frühwirth (2002):
As Time Goes By II: More Automatic Complexity Analysis of Concurrent Rule Programs.
Electronic Notes in Theoretical Computer Science 59(3),
pp. 185–206,
doi:10.1016/S1571-0661(04)00288-9.
QAPL'01, Quantitative Aspects of Programming Languages.
Ivan Gazeau, Dale Miller & Catuscia Palamidessi (2012):
A non-local method for robustness analysis of floating point programs.
In: Proceedings 10th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 85,
pp. 63–76,
doi:10.4204/EPTCS.85.5.
Sonja Georgievska & Suzana Andova (2010):
Testing Reactive Probabilistic Processes.
In: Proceedings Eighth Workshop on Quantitative Aspects of Programming Languages,
Electronic Proceedings in Theoretical Computer Science 28,
pp. 99–113,
doi:10.4204/EPTCS.28.7.
Alessandro Giacalone, Chi-Chang Jou & Scott A. Smolka (1990):
Algebraic Reasoning for Probabilistic Concurrent Systems.
In: Programming concepts and methods: Proceedings of the IFIP Working Group 2.2, 2.3 Working Conference on Programming Concepts and Methods,
pp. 443–458.
Available at https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.3664&rank=1.
Daniel T. Gillespie (1977):
Exact stochastic simulation of coupled chemical reactions.
The Journal of Physical Chemistry 81(25),
pp. 2340–2361,
doi:10.1021/j100540a008.
Sergio Giro (2014):
Optimal schedulers vs optimal bases: An approach for efficient exact solving of Markov decision processes.
Theoretical Computer Science 538,
pp. 70–83,
doi:10.1016/j.tcs.2013.08.020.
Quantitative Aspects of Programming Languages and Systems (2011-12).
Sergio Giro, Pedro R. D'Argenio & Luis María Ferrer Fioriti (2014):
Distributed probabilistic input/output automata: Expressiveness, (un)decidability and algorithms.
Theor. Comput. Sci. 538,
pp. 84–102,
doi:10.1016/j.tcs.2013.07.017.
James W. Gray (1991):
Toward a mathematical foundation for information flow security.
In: Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy,
pp. 21–34,
doi:10.1109/RISP.1991.130769.
Volker Gruhn & Ralf Laue (2006):
Patterns for Timed Property Specifications.
Electronic Notes in Theoretical Computer Science 153(2),
pp. 117–133,
doi:10.1016/j.entcs.2005.10.035.
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005).
Matthias Güdemann & Frank Ortmeier (2010):
Probabilistic Model-Based Safety Analysis.
In: Proceedings Eighth Workshop on Quantitative Aspects of Programming Languages,
Electronic Proceedings in Theoretical Computer Science 28,
pp. 114–128,
doi:10.4204/EPTCS.28.8.
Ernst Moritz Hahn, Arnd Hartmanns, Christian Hensel, Michaela Klauck, Joachim Klein, Jan Křetínský, David Parker, Tim Quatmann, Enno Ruijters & Marcel Steinmetz (2019):
The 2019 Comparison of Tools for the Analysis of Quantitative Formal Models.
In: Tools and Algorithms for the Construction and Analysis of Systems (TACAS),
LNCS 11429.
Springer,
pp. 69–92,
doi:10.1007/978-3-030-17502-3_5.
Tingting Han, Christian Krause, Marta Kwiatkowska & Holger Giese (2013):
Modal Specifications for Probabilistic Timed Systems.
In: Proceedings 11th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 117,
pp. 66–80,
doi:10.4204/EPTCS.117.5.
Chris Hankin & Herbert Wiklicky (2005):
Lambda-calculus and Quantitative Program Analysis: (Extended Abstract).
Electronic Notes in Theoretical Computer Science 112,
pp. 5–18,
doi:10.1016/j.entcs.2004.01.016.
Proceedings of the Second Workshop on Quantitative Aspects of Programming Languages (QAPL 2004).
Henri Hansen & Mark Timmer (2014):
A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time.
Theoretical Computer Science 538,
pp. 103–123,
doi:10.1016/j.tcs.2013.07.014.
Quantitative Aspects of Programming Languages and Systems (2011-12).
Richard A. Hayden, Anton Stefanek & Jeremy T. Bradley (2012):
Fluid computation of passage-time distributions in large Markov models.
Theoretical Computer Science 413(1),
pp. 106–141,
doi:10.1016/j.tcs.2011.07.017.
Quantitative Aspects of Programming Languages (QAPL 2010).
Dan Hirsch, Alberto Lluch-Lafuente & Emilio Tuosto (2006):
A Logic for Application Level QoS.
Electronic Notes in Theoretical Computer Science 153(2),
pp. 135–159,
doi:10.1016/j.entcs.2005.10.036.
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005).
Joe Hurd, Annabelle McIver & Carroll Morgan (2005):
Probabilistic guarded commands mechanized in HOL.
Theor. Comput. Sci. 346(1),
pp. 96–112,
doi:10.1016/j.tcs.2005.08.005.
Quantitative Aspects of Programming Languages.
Michael Huth (2005):
Abstraction and Probabilities for Hybrid Logics.
Electronic Notes in Theoretical Computer Science 112,
pp. 61–76,
doi:10.1016/j.entcs.2004.01.023.
Proceedings of the Second Workshop on Quantitative Aspects of Programming Languages (QAPL 2004).
Michael Huth (2005):
On finite-state approximants for probabilistic computation tree logic.
Theor. Comput. Sci. 346(1),
pp. 113–134,
doi:10.1016/j.tcs.2005.08.008.
Quantitative Aspects of Programming Languages.
Zeinab Iranmanesh & Mehran S. Fallah (2016):
Specification and static enforcement of scheduler-independent noninterference in a middleweight Java.
Computer Languages, Systems and Structures 46,
pp. 20–43,
doi:10.1016/j.cl.2016.05.003.
Vineeth Kashyap, Ben Wiedermann & Ben Hardekopf (2011):
Timing- and termination-sensitive secure information flow: Exploring a new approach.
In: Proceedings - IEEE Symposium on Security and Privacy,
pp. 413–428,
doi:10.1109/SP.2011.19.
Joost-Pieter Katoen, Jaco van de Pol, Mariëlle Stoelinga & Mark Timmer (2012):
A linear process-algebraic format with data for probabilistic automata.
Theoretical Computer Science 413(1),
pp. 36–57,
doi:10.1016/j.tcs.2011.07.021.
Quantitative Aspects of Programming Languages (QAPL 2010).
Mark Kattenbelt, Marta Kwiatkowska, Gethin Norman & David Parker (2008):
Game-Based Probabilistic Predicate Abstraction in PRISM.
Electronic Notes in Theoretical Computer Science 220(3),
pp. 5–21,
doi:10.1016/j.entcs.2008.11.016.
Proceedings of the Sixth Workshop on Quantitative Aspects of Programming Languages (QAPL 2008).
Yusuke Kawamoto & Thomas Given-Wilson (2015):
Quantitative Information Flow for Scheduler-Dependent Systems.
In: Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 194,
pp. 48–62,
doi:10.4204/EPTCS.194.4.
Vladimir Klebanov (2014):
Precise quantitative information flow analysis— a symbolic approach.
Theoretical Computer Science 538,
pp. 124–139,
doi:10.1016/j.tcs.2014.04.022.
Quantitative Aspects of Programming Languages and Systems (2011-12).
Barbara König, Sebastian Küpper & Christina Mika (2017):
PAWS: A Tool for the Analysis of Weighted Systems.
In: Proceedings 15th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 250,
pp. 75–91,
doi:10.4204/EPTCS.250.5.
Marta Kwiatkowska, Gethin Norman & David Parker (2006):
Quantitative Analysis With the Probabilistic Model Checker PRISM.
Electronic Notes in Theoretical Computer Science 153(2),
pp. 5–31,
doi:10.1016/j.entcs.2005.10.030.
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005).
Cosimo Laneve, Sylvain Pradalier & Gianluigi Zavattaro (2009):
From Biochemistry to Stochastic Processes.
Electronic Notes in Theoretical Computer Science 253(3),
pp. 167–185,
doi:10.1016/j.entcs.2009.10.011.
Proceedings of Seventh Workshop on Quantitative Aspects of Programming Languages (QAPL 2009).
Ruggero Lanotte, Andrea Maggiolo-Schettini & Angelo Troina (2005):
Automatic Analysis of a Non-Repudiation Protocol.
Electronic Notes in Theoretical Computer Science 112(SPEC. ISS.),
pp. 113–129,
doi:10.1016/j.entcs.2004.01.020.
Proceedings of the Second Workshop on Quantitative Aspects of Programming Languages (QAPL 2004).
Ruggero Lanotte, Andrea Maggiolo-Schettini & Angelo Troina (2006):
A Classification of Time and/or Probability Dependent Security Properties.
Electronic Notes in Theoretical Computer Science 153(2),
pp. 177–193,
doi:10.1016/j.entcs.2005.10.038.
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005).
Kim G. Larsen, Simon Laursen & Martin Zimmermann (2016):
Limit Your Consumption! Finding Bounds in Average-energy Games.
In: Proceedings 14th Workshop Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 227,
pp. 1–14,
doi:10.4204/EPTCS.227.1.
Slawomir Lasota & Marcin Poturalski (2016):
Undecidability of performance equivalence of Petri nets.
Theor. Comput. Sci. 655,
pp. 109–119,
doi:10.1016/j.tcs.2016.01.034.
Diego Latella, Michele Loreti, Mieke Massink & Valerio Senni (2014):
Stochastically timed predicate-based communication primitives for autonomic computing.
In: Proceedings Twelfth Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 154,
pp. 1–16,
doi:10.4204/EPTCS.154.1.
Diego Latella & Mieke Massink (2017):
Design and Optimisation of the FlyFast Front-end for Attribute-based Coordination.
In: Proceedings 15th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 250,
pp. 92–110,
doi:10.4204/EPTCS.250.6.
Diego Latella, Mieke Massink & Erik de Vink (2015):
A Definition Scheme for Quantitative Bisimulation.
In: Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 194,
pp. 63–78,
doi:10.4204/EPTCS.194.5.
Matias D. Lee & Erik P. de Vink (2015):
Rooted branching bisimulation as a congruence for probabilistic transition systems.
In: Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 194,
pp. 79–94,
doi:10.4204/EPTCS.194.6.
Karl Lermer, Colin J. Fidge & Ian J. Hayes (2005):
A theory for execution-time derivation in real-time programs.
Theoretical Computer Science 346(1),
pp. 3–27,
doi:10.1016/j.tcs.2005.08.003.
Quantitative Aspects of Programming Languages (QAPL 2004).
Alberto Lluch-Lafuente & Ugo Montanari (2005):
Quantitative mu-calculus and CTL defined over constraint semirings.
Theor. Comput. Sci. 346(1),
pp. 135–160,
doi:10.1016/j.tcs.2005.08.006.
Quantitative Aspects of Programming Languages.
Ludovica Luisa Vissat, Jane Hillston, Glenn Marion & Matthew J. Smith (2016):
MELA: Modelling in Ecology with Location Attributes.
In: Proceedings 14th Workshop Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 227,
pp. 82–97,
doi:10.4204/EPTCS.227.6.
Fabio Martinelli, Ilaria Matteucci & Francesco Santini (2015):
Semiring-based Specification Approaches for Quantitative Security.
In: Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 194,
pp. 95–109,
doi:10.4204/EPTCS.194.7.
Annabelle McIver & Carroll Morgan (2006):
A Novel Stochastic Game Via the Quantitative μ-calculus.
Electronic Notes in Theoretical Computer Science 153(2),
pp. 195–212,
doi:10.1016/j.entcs.2005.10.039.
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005).
Annabelle McIver, Tahiry Rabehaja & Georg Struth (2013):
Probabilistic Concurrent Kleene Algebra.
In: Proceedings 11th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 117,
pp. 97–115,
doi:10.4204/EPTCS.117.7.
Marino Miculan & Marco Peressotti (2016):
Structural operational semantics for non-deterministic processes with quantitative aspects.
Theoretical Computer Science 655,
pp. 135–154,
doi:10.1016/j.tcs.2016.01.012.
Quantitative Aspects of Programming Languages and Systems (2013-14).
Bruno Montalto & Carlos Caleiro (2009):
Modeling and Reasoning about an Attacker with Cryptanalytical Capabilities.
Electronic Notes in Theoretical Computer Science 253(3),
pp. 143–165,
doi:10.1016/j.entcs.2009.10.010.
Proceedings of Seventh Workshop on Quantitative Aspects of Programming Languages (QAPL 2009).
Chunyan Mu & David Clark (2009):
An Interval-based Abstraction for Quantifying Information Flow.
Electronic Notes in Theoretical Computer Science 253(3),
pp. 119–141,
doi:10.1016/j.entcs.2009.10.009.
Proceedings of Seventh Workshop on Quantitative Aspects of Programming Languages (QAPL 2009).
Ukachukwu Ndukwu & Annabelle McIver (2010):
An expectation transformer approach to predicate abstraction and data independence for probabilistic programs.
In: Proceedings Eighth Workshop on Quantitative Aspects of Programming Languages,
Electronic Proceedings in Theoretical Computer Science 28,
pp. 129–143,
doi:10.4204/EPTCS.28.9.
Tri Minh Ngo & Marieke Huisman (2013):
Quantitative Security Analysis for Multi-threaded Programs.
In: Proceedings 11th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 117,
pp. 34–48,
doi:10.4204/EPTCS.117.3.
Anna Philippou, Insup Lee & Oleg Sokolsky (2012):
PADS: An approach to modeling resource demand and supply for the formal analysis of hierarchical scheduling.
Theoretical Computer Science 413(1),
pp. 2–20,
doi:10.1016/j.tcs.2011.08.025.
Quantitative Aspects of Programming Languages (QAPL 2010).
Sylvain Pradalier & Catuscia Palamidessi (2006):
Expressiveness of Probabilistic pi-calculus.
Electronic Notes in Theoretical Computer Science 164(3),
pp. 119–136,
doi:10.1016/j.entcs.2006.07.015.
Proceedings of the 4th Workshop on Quantitative Aspects of Programming Languages (QAPL 2006).
Markus Rabe & Sven Schewe (2010):
Optimal Time-Abstract Schedulers for CTMDPs and Markov Games.
In: Proceedings Eighth Workshop on Quantitative Aspects of Programming Languages,
Electronic Proceedings in Theoretical Computer Science 28,
pp. 144–158,
doi:10.4204/EPTCS.28.10.
Aviv Regev, Ekaterina M. Panina, William Silverman, Luca Cardelli & Ehud Shapiro (2004):
BioAmbients: an abstraction for biological compartments.
Theor. Comput. Sci. 325(1),
pp. 141–167,
doi:10.1016/j.tcs.2004.03.061.
Anne Remke, Boudewijn R. Haverkort & Lucia Cloth (2007):
CSL model checking algorithms for QBDs.
Theoretical Computer Science 382(1),
pp. 24–41,
doi:10.1016/j.tcs.2007.05.007.
Quantitative Aspects of Programming Languages.
Mads Rosendahl & Maja H. Kirkeby (2015):
Probabilistic Output Analysis by Program Manipulation.
In: Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 194,
pp. 110–124,
doi:10.4204/EPTCS.194.8.
Michal Rutkowski (2011):
Two-Player Reachability-Price Games on Single-Clock Timed Automata.
In: Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages,
Electronic Proceedings in Theoretical Computer Science 57,
pp. 31–46,
doi:10.4204/EPTCS.57.3.
Andrei Sabelfeld & David Sands (2000):
Probabilistic Noninterference for Multi-Threaded Programs.
In: 13th IEEE Workshop on Computer Security Foundations.
IEEE Computer Society,
pp. 200–214,
doi:10.1109/CSFW.2000.856937.
Vijay A. Saraswat & Martin Rinard (1990):
Concurrent Constraint Programming.
In: Proc. of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
POPL'90.
ACM,
pp. 232–245,
doi:10.1145/96709.96733.
Stefan Schupp, Johanna Nellen & Erika Ábrahám (2017):
Divide and Conquer: Variable Set Separation in Hybrid Systems Reachability Analysis.
In: Proceedings 15th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 250,
pp. 1–14,
doi:10.4204/EPTCS.250.1.
Viktor Schuppan (2016):
Enhancing unsatisfiable cores for LTL with information on temporal relevance.
Theoretical Computer Science 655,
pp. 155–192,
doi:10.1016/j.tcs.2016.01.014.
Quantitative Aspects of Programming Languages and Systems (2013-14).
Ehud Shapiro (1992):
Embeddings among concurrent programming languages.
In: W.R. Cleaveland: CONCUR'92,
LNCS 630.
Springer,
pp. 486–503,
doi:10.1007/BFb0084811.
Igor Siveroni (2006):
Filling Out the Gaps: A Padding Algorithm for Transforming Out Timing Leaks.
Electronic Notes in Theoretical Computer Science 153(2),
pp. 241–257,
doi:10.1016/j.entcs.2005.10.041.
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005).
Michael J.A. Smith (2007):
Stochastic Modelling of Communication Protocols from Source Code.
Electronic Notes in Theoretical Computer Science 190(3),
pp. 129–145,
doi:10.1016/j.entcs.2007.08.013.
Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages (QAPL 2007).
Michael J.A. Smith (2008):
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions.
Electronic Notes in Theoretical Computer Science 220(3),
pp. 43–59,
doi:10.1016/j.entcs.2008.11.018.
Proceedings of the Sixth Workshop on Quantitative Aspects of Programming Languages (QAPL 2008).
Lei Song, Flemming Nielson & Bo Friis Nielsen (2011):
A Stochastic Broadcast Pi-Calculus.
In: Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages,
Electronic Proceedings in Theoretical Computer Science 57,
pp. 74–88,
doi:10.4204/EPTCS.57.6.
Pascal Sotin, David Cachera & Thomas Jensen (2006):
Quantitative Static Analysis Over Semirings: Analysing Cache Behaviour for Java Card.
Electronic Notes in Theoretical Computer Science 164(3),
pp. 153–167,
doi:10.1016/j.entcs.2006.07.017.
Proceedings of the 4th Workshop on Quantitative Aspects of Programming Languages (QAPL 2006).
David Spieler, Ernst Moritz Hahn & Lijun Zhang (2014):
Model Checking CSL for Markov Population Models.
In: Proceedings Twelfth Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 154,
pp. 93–107,
doi:10.4204/EPTCS.154.7.
Anton Stefanek, Richard Hayden & Jeremy Bradley (2010):
A new tool for the performance analysis of massively parallel computer systems.
In: Proceedings Eighth Workshop on Quantitative Aspects of Programming Languages,
Electronic Proceedings in Theoretical Computer Science 28,
pp. 159–181,
doi:10.4204/EPTCS.28.11.
Mark Timmer, Joost-Pieter Katoen, Jaco van de Pol & Marielle Stoelinga (2016):
Confluence reduction for Markov automata.
Theoretical Computer Science 655,
pp. 193–219,
doi:10.1016/j.tcs.2016.01.017.
Quantitative Aspects of Programming Languages and Systems (2013-14).
Mathieu Tracol, Josée Desharnais & Abir Zhioua (2011):
Computing Distances between Probabilistic Automata.
In: Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages,
Electronic Proceedings in Theoretical Computer Science 57,
pp. 148–162,
doi:10.4204/EPTCS.57.11.
Paolo Tranquilli (2013):
Indexed Labels for Loop Iteration Dependent Costs.
In: Proceedings 11th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 117,
pp. 19–33,
doi:10.4204/EPTCS.117.2.
Max Tschaikowski & Mirco Tribastone (2014):
Exact fluid lumpability in Markovian process algebra.
Theoretical Computer Science 538,
pp. 140–166,
doi:10.1016/j.tcs.2013.07.029.
Quantitative Aspects of Programming Languages and Systems (2011-12).
Max Tschaikowski & Mirco Tribastone (2014):
Extended Differential Aggregations in Process Algebra for Performance and Biology.
In: Proceedings Twelfth Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 154,
pp. 34–47,
doi:10.4204/EPTCS.154.3.
Evan Tzanis & Robin Hirsch (2008):
Probabilistic Logic over Paths.
Electronic Notes in Theoretical Computer Science 220(3),
pp. 79–96,
doi:10.1016/j.entcs.2008.11.020.
Proceedings of the Sixth Workshop on Quantitative Aspects of Programming Languages (QAPL 2008).
Andrea Vandin (2017):
Language-based Abstractions for Dynamical Systems.
In: Proceedings 15th Workshop on Quantitative Aspects of Programming Languages and Systems,
Electronic Proceedings in Theoretical Computer Science 250,
pp. 15–24,
doi:10.4204/EPTCS.250.2.
Daniele Varacca & Nobuko Yoshida (2007):
Probabilistic Pi-Calculus and Event Structures.
Electronic Notes in Theoretical Computer Science 190(3),
pp. 147–166,
doi:10.1016/j.entcs.2007.07.009.
Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages (QAPL 2007).
Maria Grazia Vigliotti & Peter G. Harrison (2006):
Stochastic Ambient Calculus.
Electronic Notes in Theoretical Computer Science 164(3),
pp. 169–186,
doi:10.1016/j.entcs.2006.07.018.
Proceedings of the 4th Workshop on Quantitative Aspects of Programming Languages (QAPL 2006).
Dennis M. Volpano & Geoffrey Smith (1999):
Probabilistic Noninterference in a Concurrent Language.
Journal of Computer Security 7(1),
pp. 231–253,
doi:10.3233/JCS-1999-72-305.
Verena Wolf, Christel Baier & Mila Majster-Cederbaum (2006):
Trace Machines for Observing Continuous-Time Markov Chains.
Electronic Notes in Theoretical Computer Science 153(2),
pp. 259–277,
doi:10.1016/j.entcs.2005.10.042.
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages (QAPL 2005).
Verena Wolf, Christel Baier & Mila Majster-Cederbaum (2006):
Trace Semantics for Stochastic Systems with Nondeterminism.
Electronic Notes in Theoretical Computer Science 164(3),
pp. 187–204,
doi:10.1016/j.entcs.2006.07.019.
Proceedings of the 4th Workshop on Quantitative Aspects of Programming Languages (QAPL 2006).
Gagarine Yaikhom, Murray Cole, Stephen Gilmore & Jane Hillston (2007):
A Structural Approach for Modelling Performance of Systems Using Skeletons.
Electronic Notes in Theoretical Computer Science 190(3),
pp. 167–183,
doi:10.1016/j.entcs.2007.07.010.
Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages (QAPL 2007).
Hirotoshi Yasuoka & Tachio Terauchi (2014):
Quantitative information flow as safety and liveness hyperproperties.
Theoretical Computer Science 538,
pp. 167–182,
doi:10.1016/j.tcs.2013.07.031.
Quantitative Aspects of Programming Languages and Systems (2011-12).
Jinjin Zhang & Zhaohui Zhu (2008):
A Behavioural Pseudometric based on λ–Bisimilarity.
Electronic Notes in Theoretical Computer Science 220(3),
pp. 115–127,
doi:10.1016/j.entcs.2008.11.022.
Proceedings of the Sixth Workshop on Quantitative Aspects of Programming Languages (QAPL 2008).
Miaomiao Zhang & Dang Van Hung (2006):
Formal Analysis of Streaming Downloading Protocol for System Upgrading.
Electronic Notes in Theoretical Computer Science 164(3),
pp. 205–224,
doi:10.1016/j.entcs.2006.07.020.
Proceedings of the 4th Workshop on Quantitative Aspects of Programming Languages (QAPL 2006).