Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHelmut Seidl
Person information
- affiliation: Technical University Munich, Germany
- affiliation (former): University of Trier, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j47]Sebastian Maneth, Helmut Seidl, Martin Vu
:
Definability Results for Top-Down Tree Transducers. Int. J. Found. Comput. Sci. 34(2&3): 253-287 (2023)- [j46]Sebastian Maneth, Helmut Seidl:
Deciding origin equivalence of weakly self-nesting macro tree transducers. Inf. Process. Lett. 180: 106332 (2023) - [c123]Michael Schwarz, Simmo Saan, Helmut Seidl, Julian Erhard, Vesal Vojdani:
Clustered Relational Thread-Modular Abstract Interpretation with Local Traces. ESOP 2023: 28-58 - [c122]Michael Schwarz, Julian Erhard, Vesal Vojdani, Simmo Saan, Helmut Seidl:
When Long Jumps Fall Short: Control-Flow Tracking and Misuse Detection for Non-local Jumps in C. SOAP@PLDI 2023: 20-26 - [c121]Simmo Saan, Michael Schwarz, Julian Erhard, Manuel Pietsch, Helmut Seidl, Sarah Tilscher, Vesal Vojdani:
Goblint: Autotuning Thread-Modular Abstract Interpretation - (Competition Contribution). TACAS (2) 2023: 547-552 - [i39]Michael Schwarz, Simmo Saan, Helmut Seidl, Julian Erhard, Vesal Vojdani:
Clustered Relational Thread-Modular Abstract Interpretation with Local Traces. CoRR abs/2301.06439 (2023) - [i38]Sebastian Maneth, Helmut Seidl:
Checking in Polynomial Time whether or not a Regular Tree Language is Deterministic Top-Down. CoRR abs/2306.00573 (2023) - 2022
- [c120]Sebastian Maneth, Helmut Seidl, Martin Vu:
How to Decide Functionality of Compositions of Top-Down Tree Transducers. CAI 2022: 175-191 - [e5]Helmut Seidl, Zhiming Liu, Corina S. Pasareanu:
Theoretical Aspects of Computing - ICTAC 2022 - 19th International Colloquium, Tbilisi, Georgia, September 27-29, 2022, Proceedings. Lecture Notes in Computer Science 13572, Springer 2022, ISBN 978-3-031-17714-9 [contents] - [i37]Sebastian Maneth, Helmut Seidl, Martin Vu:
How to decide Functionality of Compositions of Top-Down Tree Transducers. CoRR abs/2209.01044 (2022) - [i36]Julian Erhard, Simmo Saan, Sarah Tilscher, Michael Schwarz, Karoliine Holter, Vesal Vojdani, Helmut Seidl:
Interactive Abstract Interpretation: Reanalyzing Whole Programs for Cheap. CoRR abs/2209.10445 (2022) - 2021
- [j45]Raphaela Löbel, Michael Luttenberger, Helmut Seidl:
On the Balancedness of Tree-to-Word Transducers. Int. J. Found. Comput. Sci. 32(6): 761-783 (2021) - [j44]Helmut Seidl, Ralf Vogler:
Three improvements to the top-down solver. Math. Struct. Comput. Sci. 31(9): 1090-1134 (2021) - [c119]Sebastian Maneth, Helmut Seidl, Martin Vu:
Definability Results for Top-Down Tree Transducers. DLT 2021: 291-303 - [c118]Michael Schwarz, Simmo Saan, Helmut Seidl, Kalmer Apinis, Julian Erhard, Vesal Vojdani:
Improving Thread-Modular Abstract Interpretation. SAS 2021: 359-383 - [c117]Simmo Saan, Michael Schwarz, Kalmer Apinis, Julian Erhard, Helmut Seidl, Ralf Vogler, Vesal Vojdani:
Goblint: Thread-Modular Abstract Interpretation Using Side-Effecting Constraints - (Competition Contribution). TACAS (2) 2021: 438-442 - [i35]Sebastian Maneth, Helmut Seidl, Martin Vu:
Definability Results for Top-Down Tree Transducers. CoRR abs/2105.14860 (2021) - [i34]Michael Schwarz, Simmo Saan, Helmut Seidl, Kalmer Apinis, Julian Erhard, Vesal Vojdani:
Improving Thread-Modular Abstract Interpretation. CoRR abs/2108.07613 (2021) - 2020
- [c116]Helmut Seidl, Julian Erhard, Ralf Vogler:
Incremental Abstract Interpretation. From Lambda Calculus to Cybersecurity Through Program Analysis 2020: 132-148 - [c115]Raphaela Löbel, Michael Luttenberger, Helmut Seidl:
Equivalence of Linear Tree Transducers with Output in the Free Group. DLT 2020: 207-221 - [c114]Raphaela Löbel, Michael Luttenberger, Helmut Seidl:
On the Balancedness of Tree-to-Word Transducers. DLT 2020: 222-236 - [c113]Sebastian Maneth, Helmut Seidl:
When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic? ICALP 2020: 134:1-134:18 - [c112]Christan Müller, Helmut Seidl:
Stratified Guarded First-Order Transition Systems. SAS 2020: 113-133 - [c111]Anastasiia Izycheva, Eva Darulova, Helmut Seidl:
Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis. SAS 2020: 156-177 - [c110]Helmut Seidl, Christian Müller, Bernd Finkbeiner:
How to Win First-Order Safety Games. VMCAI 2020: 426-448 - [i33]Raphaela Löbel, Michael Luttenberger, Helmut Seidl:
Equivalence of Linear Tree Transducers with Output in the Free Group. CoRR abs/2001.03480 (2020)
2010 – 2019
- 2019
- [c109]Anastasiia Izycheva, Eva Darulova, Helmut Seidl:
Synthesizing Efficient Low-Precision Kernels. ATVA 2019: 294-313 - [c108]Helmut Seidl, Raphaela Palenta, Sebastian Maneth:
Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time. FoSSaCS 2019: 488-504 - [i32]Helmut Seidl, Raphaela Palenta, Sebastian Maneth:
Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time. CoRR abs/1902.03858 (2019) - [i31]Helmut Seidl, Christian Müller, Bernd Finkbeiner:
How to Win First-Order Safety Games. CoRR abs/1908.05964 (2019) - [i30]Raphaela Löbel, Michael Luttenberger, Helmut Seidl:
On the Balancedness of Tree-to-word Transducers. CoRR abs/1911.13054 (2019) - 2018
- [j43]Stefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler:
Enforcing termination of interprocedural analysis. Formal Methods Syst. Des. 53(2): 313-338 (2018) - [j42]Sebastian Maneth, Helmut Seidl:
Balancedness of MSO transductions in polynomial time. Inf. Process. Lett. 133: 26-32 (2018) - [j41]Helmut Seidl, Sebastian Maneth, Gregor Kemper:
Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable. J. ACM 65(4): 21:1-21:30 (2018) - [j40]Andreas Reuß, Helmut Seidl:
Paths, tree homomorphisms and disequalities for -clauses. Math. Struct. Comput. Sci. 28(10): 1786-1846 (2018) - [c107]Christian Müller, Helmut Seidl, Eugen Zalinescu:
Inductive Invariants for Noninterference in Multi-agent Workflows. CSF 2018: 247-261 - [c106]Helmut Seidl, Ralf Vogler:
Three Improvements to the Top-Down Solver. PPDP 2018: 21:1-21:14 - [c105]Michael Luttenberger, Raphaela Palenta, Helmut Seidl:
Computing the Longest Common Prefix of a Context-free Language in Polynomial Time. STACS 2018: 48:1-48:13 - 2017
- [j39]Stefan Schulze Frielinghaus, Michael Petter, Helmut Seidl:
Inter-procedural Two-Variable Herbrand Equalities. Log. Methods Comput. Sci. 13(2) (2017) - [c104]Helmut Seidl, Ralf Vogler:
Proving Absence of Starvation by Means of Abstract Interpretation and Model Checking. ATVA 2017: 3-22 - [c103]Bernd Finkbeiner, Christian Müller, Helmut Seidl, Eugen Zalinescu:
Verifying Security Policies in Multi-agent Workflows with Loops. CCS 2017: 633-645 - [c102]Anca Muscholl, Helmut Seidl, Igor Walukiewicz:
Reachability for Dynamic Parametric Processes. VMCAI 2017: 424-441 - [i29]Michael Luttenberger, Raphaela Palenta, Helmut Seidl:
Computing the longest common prefix of a context-free language in polynomial time. CoRR abs/1702.06698 (2017) - [i28]Bernd Finkbeiner, Christian Müller, Helmut Seidl, Eugen Zalinescu:
Verifying Security Policies in Multi-agent Workflows with Loops. CoRR abs/1708.09013 (2017) - [i27]Emmanuel Filiot, Sebastian Maneth, Helmut Seidl:
Formal Methods of Transformations (Dagstuhl Seminar 17142). Dagstuhl Reports 7(4): 23-37 (2017) - 2016
- [j38]Gianluca Amato, Francesca Scozzari, Helmut Seidl, Kalmer Apinis, Vesal Vojdani:
Efficiently intertwining widening and narrowing. Sci. Comput. Program. 120: 1-24 (2016) - [j37]Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
Look-ahead removal for total deterministic top-down tree transducers. Theor. Comput. Sci. 616: 18-58 (2016) - [c101]Bernd Finkbeiner, Helmut Seidl, Christian Müller:
Specifying and Verifying Secrecy in Workflows with Arbitrarily Many Agents. ATVA 2016: 157-173 - [c100]Kalmer Apinis, Helmut Seidl, Vesal Vojdani:
Enhancing Top-Down Solving with Widening and Narrowing. Semantics, Logics, and Calculi 2016: 272-288 - [c99]Vesal Vojdani, Kalmer Apinis, Vootele Rõtov, Helmut Seidl, Varmo Vene, Ralf Vogler:
Static race detection for device drivers: the Goblint approach. ASE 2016: 391-402 - [c98]Stefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler:
Enforcing Termination of Interprocedural Analysis. SAS 2016: 447-468 - [p6]Helmut Seidl, Sebastian Maneth, Gregor Kemper, Joost Engelfriet:
Equivalence - Combinatorics, Algebra, Proofs. Dependable Software Systems Engineering 2016: 202-243 - [i26]Stefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler:
Enforcing Termination of Interprocedural Analysis. CoRR abs/1606.07687 (2016) - [i25]Anca Muscholl, Helmut Seidl, Igor Walukiewicz:
Reachability for dynamic parametric processes. CoRR abs/1609.05385 (2016) - 2015
- [c97]Christian Müller, Máté Kovács, Helmut Seidl:
An Analysis of Universal Information Flow Based on Self-Composition. CSF 2015: 380-393 - [c96]Stefan Schulze Frielinghaus, Michael Petter, Helmut Seidl:
Inter-procedural Two-Variable Herbrand Equalities. ESOP 2015: 457-482 - [c95]Helmut Seidl, Sebastian Maneth, Gregor Kemper:
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. FOCS 2015: 943-962 - [c94]Sebastian Maneth, Alberto Ordóñez Pereira, Helmut Seidl:
Transforming XML Streams with References. SPIRE 2015: 33-45 - [i24]Gianluca Amato, Francesca Scozzari, Helmut Seidl, Kalmer Apinis, Vesal Vojdani:
Efficiently intertwining widening and narrowing. CoRR abs/1503.00883 (2015) - [i23]Helmut Seidl, Sebastian Maneth, Gregor Kemper:
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. CoRR abs/1503.09163 (2015) - 2014
- [j36]Thomas Martin Gawlitza, Helmut Seidl:
Numerical invariants through convex relaxation and max-strategy iteration. Formal Methods Syst. Des. 44(2): 101-148 (2014) - [c93]Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
How to Remove the Look-Ahead of Top-Down Tree Transducers. Developments in Language Theory 2014: 103-115 - [c92]Helmut Seidl, Máté Kovács:
Interprocedural Information Flow Analysis of XML Processors. LATA 2014: 34-61 - [c91]Helmut Seidl, Thomas Martin Gawlitza, Martin D. Schwarz:
Parametric Strategy Iteration. SCSS 2014: 62-76 - [c90]Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Kalmer Apinis:
Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs. VMCAI 2014: 21-38 - [p5]Helmut Seidl, Kalmer Apinis, Vesal Vojdani:
Frameworks for Interprocedural Analysis of Concurrent Programs. Software Systems Safety 2014: 309-347 - [e4]Markus Müller-Olm, Helmut Seidl:
Static Analysis - 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings. Lecture Notes in Computer Science 8723, Springer 2014, ISBN 978-3-319-10935-0 [contents] - [e3]Orna Grumberg, Helmut Seidl, Maximilian Irlbeck:
Software Systems Safety. NATO Science for Peace and Security Series, D: Information and Communication Security 36, IOS Press 2014, ISBN 978-1-61499-384-1 [contents] - [i22]Thomas Martin Gawlitza, Martin D. Schwarz, Helmut Seidl:
Parametric Strategy Iteration. CoRR abs/1406.5457 (2014) - [i21]Stefan Schulze Frielinghaus, Michael Petter, Helmut Seidl:
Inter-procedural Two-Variable Herbrand Equalities. CoRR abs/1410.4416 (2014) - 2013
- [b3]Reinhard Wilhelm, Helmut Seidl, Sebastian Hack:
Compiler Design - Syntactic and Semantic Analysis. Springer 2013, ISBN 978-3-642-17539-8, pp. I-X, 1-225 - [c89]Máté Kovács, Helmut Seidl, Bernd Finkbeiner:
Relational abstract interpretation for the verification of 2-hypersafety properties. CCS 2013: 211-222 - [c88]Kalmer Apinis, Helmut Seidl, Vesal Vojdani:
How to combine widening and narrowing for non-monotonic systems of equations. PLDI 2013: 377-386 - [c87]Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner:
Contextual Locking for Dynamic Pushdown Networks. SAS 2013: 477-498 - [i20]Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
Look-Ahead Removal for Top-Down Tree Transducers. CoRR abs/1311.2400 (2013) - [i19]Sebastian Maneth, Helmut Seidl:
Tree Transducers and Formal Methods (Dagstuhl Seminar 13192). Dagstuhl Reports 3(5): 1-18 (2013) - 2012
- [b2]Helmut Seidl, Reinhard Wilhelm, Sebastian Hack:
Compiler Design - Analysis and Transformation. Springer 2012, ISBN 978-3-642-17547-3, pp. I-XII, 1-177 - [j35]Thomas Martin Gawlitza, Helmut Seidl, Assalé Adjé, Stéphane Gaubert, Eric Goubault:
Abstract interpretation meets convex optimization. J. Symb. Comput. 47(12): 1416-1446 (2012) - [c86]Kalmer Apinis, Helmut Seidl, Vesal Vojdani:
Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis. APLAS 2012: 157-172 - [c85]Máté Kovács, Helmut Seidl:
Runtime Enforcement of Information Flow Security in Tree Manipulating Processes. ESSoS 2012: 46-59 - [c84]Helmut Seidl, Andreas Reuß:
Extending ${\cal H}_1$ -Clauses with Path Disequalities. FoSSaCS 2012: 165-179 - [c83]Rayna Dimitrova, Bernd Finkbeiner, Máté Kovács, Markus N. Rabe, Helmut Seidl:
Model Checking Information Flow in Reactive Systems. VMCAI 2012: 169-185 - [c82]Andreas Reuß, Helmut Seidl:
Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses. CIAA 2012: 301-312 - [p4]Sebastian Maneth, Sylvia Friese, Helmut Seidl:
Type Checking of Tree Walking Transducers. Modern Applications of Automata Theory 2012: 325-372 - [p3]Thomas Martin Gawlitza, Helmut Seidl:
Precise Program Analysis through Strategy Iteration and Optimization. Software Safety and Security 2012: 348-384 - [e2]Helmut Seidl:
Programming Languages and Systems - 21st European Symposium on Programming, ESOP 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings. Lecture Notes in Computer Science 7211, Springer 2012, ISBN 978-3-642-28868-5 [contents] - [i18]Thomas Martin Gawlitza, Helmut Seidl:
Numerical Invariants through Convex Relaxation and Max-Strategy Iteration. CoRR abs/1204.1147 (2012) - 2011
- [j34]Sylvia Friese, Helmut Seidl, Sebastian Maneth:
Earliest Normal Form and Minimization for Bottom-up Tree Transducers. Int. J. Found. Comput. Sci. 22(7): 1607-1623 (2011) - [j33]Helmut Seidl, Andreas Reuß:
Extending H1-clauses with disequalities. Inf. Process. Lett. 111(20): 1007-1013 (2011) - [j32]Thomas Martin Gawlitza, Helmut Seidl:
Solving systems of rational equations through strategy iteration. ACM Trans. Program. Lang. Syst. 33(3): 11:1-11:48 (2011) - [j31]Andrea Flexeder, Markus Müller-Olm, Michael Petter, Helmut Seidl:
Fast interprocedural linear two-variable equalities. ACM Trans. Program. Lang. Syst. 33(6): 21:1-21:33 (2011) - [c81]Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Peter Lammich, Markus Müller-Olm:
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol. POPL 2011: 93-104 - [c80]Andrea Flexeder, Michael Petter, Helmut Seidl:
Side-Effect Analysis of Assembly Code. SAS 2011: 77-94 - [c79]Thomas Martin Gawlitza, Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner:
Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation. VMCAI 2011: 199-213 - 2010
- [b1]Reinhard Wilhelm, Helmut Seidl:
Compiler Design - Virtual Machines. Springer 2010, ISBN 978-3-642-14908-5, pp. I-XIII, 1-187 - [j30]Helmut Seidl:
Praktische Programmverifikation durch statische Analyse. Inform. Spektrum 33(5): 484-488 (2010) - [c78]Andrea Flexeder, Bogdan Mihaila, Michael Petter, Helmut Seidl:
Interprocedural Control Flow Reconstruction. APLAS 2010: 188-203 - [c77]Thomas Martin Gawlitza, Helmut Seidl:
Abstract Interpretation over Zones without Widening. WING@ETAPS/IJCAR 2010: 12-43 - [c76]Sylvia Friese, Helmut Seidl, Sebastian Maneth:
Minimization of Deterministic Bottom-Up Tree Transducers. Developments in Language Theory 2010: 185-196 - [c75]Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl:
What Is a Pure Functional? ICALP (2) 2010: 199-210 - [c74]Andreas Reuß, Helmut Seidl:
Bottom-Up Tree Automata with Term Constraints. LPAR (Yogyakarta) 2010: 581-593 - [c73]Thomas Martin Gawlitza, Helmut Seidl:
Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely. SAS 2010: 271-286 - [c72]Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl:
Verifying a Local Generic Solver in Coq. SAS 2010: 340-355 - [c71]Thomas Martin Gawlitza, Helmut Seidl, Kumar Neeraj Verma:
Normalization of Linear Horn Clauses. SBMF 2010: 242-257 - [c70]Jörg Kreiker, Helmut Seidl, Vesal Vojdani:
Shape Analysis of Low-Level C with Overlapping Structures. VMCAI 2010: 214-230
2000 – 2009
- 2009
- [j29]Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
Deciding equivalence of top-down XML transformations in polynomial time. J. Comput. Syst. Sci. 75(5): 271-286 (2009) - [c69]Thomas Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm:
Polynomial Precise Interval Analysis Revisited. Efficient Algorithms 2009: 422-437 - [c68]Thomas Gawlitza, Helmut Seidl:
Games through Nested Fixpoints. CAV 2009: 291-305 - [c67]Helmut Seidl, Vesal Vojdani, Varmo Vene:
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis. FM 2009: 644-659 - [c66]Helmut Seidl, Kumar Neeraj Verma:
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case. RTA 2009: 118-132 - [c65]Helmut Seidl, Vesal Vojdani:
Region Analysis for Race Detection. SAS 2009: 171-187 - [c64]Helmut Seidl:
Program Analysis through Finite Tree Automata. CIAA 2009: 3 - 2008
- [j28]Helmut Seidl, Kumar Neeraj Verma:
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying. ACM Trans. Comput. Log. 9(4): 28:1-28:45 (2008) - [c63]Helmut Seidl, Thomas Schwentick, Anca Muscholl:
Counting in trees. Logic and Automata 2008: 575-612 - [c62]Markus Müller-Olm, Helmut Seidl:
Upper Adjoints for Fast Inter-procedural Variable Equalities. ESOP 2008: 178-192 - [c61]Thomas Gawlitza, Helmut Seidl:
Precise Interval Analysis vs. Parity Games. FM 2008: 342-357 - [c60]Martin Leucker, Helmut Seidl:
Lightweight Verification 2008. GI Jahrestagung (2) 2008: 965-966 - [c59]Javier Esparza, Thomas Gawlitza, Stefan Kiefer, Helmut Seidl:
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. ICALP (1) 2008: 698-710 - [c58]Helmut Seidl, Andrea Flexeder, Michael Petter:
Analysing All Polynomial Equations in . SAS 2008: 299-314 - 2007
- [j27]Markus Müller-Olm, Helmut Seidl:
Analysis of modular arithmetic. ACM Trans. Program. Lang. Syst. 29(5): 29 (2007) - [c57]Thomas Gawlitza, Helmut Seidl:
Computing Game Values for Crash Games. ATVA 2007: 177-191 - [c56]Thomas Gawlitza, Helmut Seidl:
Precise Relational Invariants Through Strategy Iteration. CSL 2007: 23-40 - [c55]Helmut Seidl, Andrea Flexeder, Michael Petter:
Interprocedurally Analysing Linear Inequality Relations. ESOP 2007: 284-299 - [c54]Thomas Gawlitza, Helmut Seidl:
Precise Fixpoint Computation Through Strategy Iteration. ESOP 2007: 300-315 - [c53]Sebastian Maneth, Thomas Perst, Helmut Seidl:
Exact XML Type Checking in Polynomial Time. ICDT 2007: 254-268 - [c52]Sebastian Maneth, Helmut Seidl:
Deciding Equivalence of Top-Down XML Transformations in Polynomial Time. PLAN-X 2007: 73-79 - [e1]Helmut Seidl:
Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings. Lecture Notes in Computer Science 4423, Springer 2007, ISBN 978-3-540-71388-3 [contents] - 2006
- [j26]