Felix Klaedtke

Affiliations:
  • NEC Labs Europe, Heidelberg, Germany
  • ETH Zurich, Switzerland (former)
  • University of Freiburg, Germany (PhD 2004)


According to our database1, Felix Klaedtke authored at least 51 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
POLIMON: Checking Temporal Properties over Out-of-order Streams at Runtime.
CoRR, 2024

2021
TeraFlow: Secured Autonomic Traffic Management for a Tera of SDN flows.
Proceedings of the Joint European Conference on Networks and Communications & 6G Summit, 2021

2020
Runtime Verification over Out-of-order Streams.
ACM Trans. Comput. Log., 2020

2019
First international Competition on Runtime Verification: rules, benchmarks, tools, and final results of CRV 2014.
Int. J. Softw. Tools Technol. Transf., 2019

2018
Algorithms for monitoring real-time properties.
Acta Informatica, 2018

A Security Architecture for 5G Networks.
IEEE Access, 2018

2017
The MonPoly Monitoring Tool.
Proceedings of the RV-CuBES 2017. An International Workshop on Competitions, 2017

Runtime Verification of Temporal Properties over Out-of-Order Data Streams.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
On the Fingerprinting of Software-Defined Networks.
IEEE Trans. Inf. Forensics Secur., 2016

Scalable offline monitoring of temporal specifications.
Formal Methods Syst. Des., 2016

Cases for Including a Reference Monitor to SDN.
Proceedings of the ACM SIGCOMM 2016 Conference, Florianopolis, Brazil, August 22-26, 2016, 2016

2015
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata.
ACM Trans. Comput. Log., 2015

Monitoring Metric First-Order Temporal Properties.
J. ACM, 2015

Greedily computing associative aggregations on sliding windows.
Inf. Process. Lett., 2015

Monitoring of temporal first-order properties with aggregations.
Formal Methods Syst. Des., 2015

Towards an access control scheme for accessing flows in SDN.
Proceedings of the 1st IEEE Conference on Network Softwarization, 2015

Failure-aware Runtime Verification of Distributed Systems.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014
The μ-calculus alternation hierarchy collapses over structures with restricted connectivity.
Theor. Comput. Sci., 2014

Deciding safety and liveness in TPTL.
Inf. Process. Lett., 2014

Access control for SDN controllers.
Proceedings of the third workshop on Hot topics in software defined networking, 2014

On Real-Time Monitoring with Imprecise Timestamps.
Proceedings of the Runtime Verification - 5th International Conference, 2014

Scalable Offline Monitoring.
Proceedings of the Runtime Verification - 5th International Conference, 2014

2013
Monitoring Data Usage in Distributed Systems.
IEEE Trans. Software Eng., 2013

Enforceable Security Policies Revisited.
ACM Trans. Inf. Syst. Secur., 2013

Ramsey Goes Visibly Pushdown.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
A trace-based model for multiparty contracts.
J. Log. Algebraic Methods Program., 2012

Monitoring Compliance Policies over Incomplete and Disagreeing Logs.
Proceedings of the Runtime Verification, Third International Conference, 2012

2011
Monitoring Usage-Control Policies in Distributed Systems.
Proceedings of the Eighteenth International Symposium on Temporal Representation and Reasoning, 2011

Monitoring First-order Temporal Properties.
Proceedings of the TABLEAUX 2011, 2011

MONPOLY: Monitoring Usage-Control Policies.
Proceedings of the Runtime Verification - Second International Conference, 2011

Alternation Elimination for Automata over Nested Words.
Proceedings of the Foundations of Software Science and Computational Structures, 2011

2010
Ehrenfeucht-Fraïssé goes automatic for real addition.
Inf. Comput., 2010

On regular temporal logics with past.
Acta Informatica, 2010

Monitoring security policies with metric first-order temporal logic.
Proceedings of the 15th ACM Symposium on Access Control Models and Technologies, 2010

Policy Monitoring in First-Order Temporal Logic.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

2009
Specification Languages for Stutter-Invariant Regular Properties.
Proceedings of the Automated Technology for Verification and Analysis, 2009

2008
Bounds on the automata size for Presburger arithmetic.
ACM Trans. Comput. Log., 2008

Don't care words with an application to the automata-based approach for real addition.
Formal Methods Syst. Des., 2008

Alternation Elimination by Complementation (Extended Abstract).
Proceedings of the Logic for Programming, 2008

Runtime Monitoring of Metric First-order Temporal Properties.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2007
Language-Based Abstraction Refinement for Hybrid System Verification.
Proceedings of the Verification, 2007

LIRA: Handling Constraints of Linear Arithmetics over the Integers and the Reals.
Proceedings of the Computer Aided Verification, 19th International Conference, 2007

Mechanizing the Powerset Construction for Restricted Classes of <i>omega</i> -Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2007

2005
Optimizing Bounded Model Checking for Linear Hybrid Systems.
Proceedings of the Verification, 2005

2004
Automata-based decision procedures for weak arithmetics.
PhD thesis, 2004

On the Automata Size for Presburger Arithmetic.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Automatenbasierte Entscheidungsverfahren für Teilsysteme der Arithmetik.
Proceedings of the Ausgezeichnete Informatikdissertationen 2004, 2004

2003
Decision procedures for inductive Boolean functions based on alternating automata.
Theor. Comput. Sci., 2003

Monadic Second-Order Logics with Cardinalities.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2001
Complementation of Büchi Automata Using Alternation.
Proceedings of the Automata, 2001

Decision Procedure for an Extension of WS1S.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001


  Loading...