FOR IMMEDIATE RELEASE June 8, 2010 Contact information: Kristen Fuhs Wells, Indiana Humanities Councilorx125,

Source URL: www.spiritandplace.org

Estimation of Parallel Complexity with Rewriting Techniques Christophe Alias? , Carsten Fuhs† , Laure Gonnord‡ INRIA & LIP (UMR CNRS/ENS Lyon/UCB Lyon1/INRIA), Lyon, France,

Source URL: cl-informatik.uibk.ac.at

Estimation of Parallel Complexity with Rewriting Techniques Christophe Alias, Carsten Fuhs, Laure Gonnord To cite this version: Christophe Alias, Carsten Fuhs, Laure Gonnord. Estimation of Parallel Complexity with Rewrit

Source URL: hal.archives-ouvertes.fr

ISR 2017 Advanced Course Proving Program Termination via Term Rewriting Carsten Fuhs http://www.dcs.bbk.ac.uk/~carsten/ —Abstract—

Source URL: www.win.tue.nl

Freeway Mass Transit cowritten with Chuck Fuhs* One day in the late 1960s veteran engineer Bill Ward was pondering the future of the Houston freeway. Most of the freeways in Houston’s central urban system were either

Source URL: dallasfreeways.com

14th International Workshop on Termination (WSTCarsten Fuhs (Editor) WST 2014, 17–18 July 2014, Vienna, Austria Vienna Summer of Logic Preface

Source URL: easychair.org

Synthesizing Shortest Linear Straight-Line Programs over GF(2) for the AES using SAT? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

Source URL: www.dcs.bbk.ac.uk

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

Source URL: www.dcs.bbk.ac.uk

• Theoretical computer science
• Computing
• Software engineering
• Logic in computer science
• Automated theorem proving
• Static program analysis
• Termination analysis
• Rewriting
• KeY
• Automated reasoning
• Bytecode
• Christoph Walther

Disproving termination with overapproximation Byron Cook∗† , Carsten Fuhs† , Kaustubh Nimkar† and Peter O’Hearn† ∗ Microsoft † University Research

Source URL: www.dcs.bbk.ac.uk

• Mathematics
• Dynamical systems
• Nonlinear system
• Exponentiation
• Net
• NC

A Analyzing Runtime and Size Complexity of Integer Programs Marc Brockschmidt, Microsoft Research Fabian Emmes, RWTH Aachen University Stephan Falke, Karlsruhe Institute of Technology Carsten Fuhs, Birkbeck, University o

Source URL: www.dcs.bbk.ac.uk

• Nuclear magnetic resonance
• Relaxation