World's Best Scientists 2026 revealed!
Henny B. Sipma

Henny B. Sipma

Overview

Henny B. Sipma is affiliated with Aarno Labs in the United Kingdom. The scientist's work is associated with this institution, contributing to research activities conducted there.

Available information does not list specific recent papers, co-authors, publication venues, book publications, or detailed fields and subfields of study linked to Henny B. Sipma. There are also no noted main topics of work or awards recorded.

Due to the absence of detailed publication records or academic output in the source data, it is not possible to provide an overview of the scientist's research themes or scholarly contributions. Similarly, no information is available to describe collaborations or frequent venues of publication.

Henny B. Sipma remains an active researcher associated with Aarno Labs, with further details about their work and impact not documented in the current data set.

Best Publications

  • Linear invariant generation using non-linear constraint solving

    Michael A. Colon;Sriram Sankaranarayanan;Henny B. Sipma

  • What's decidable about arrays?

    Aaron R. Bradley;Zohar Manna;Henny B. Sipma

  • Non-linear loop invariant generation using Gröbner bases

    Sriram Sankaranarayanan;Henny B. Sipma;Zohar Manna

  • LOLA: runtime monitoring of synchronous systems

    B. D'Angelo;S. Sankaranarayanan;C. Sanchez;W. Robinson

  • Synthesis of Linear Ranking Functions

    Michael Colón;Henny Sipma

  • STeP: The Stanford Temporal Prover

    Zohar Manna;Nikolaj Bjørner;Anca Browne;Edward Y. Chang

  • Scalable analysis of linear systems using mathematical programming

    Sriram Sankaranarayanan;Henny B. Sipma;Zohar Manna

  • Linear ranking with reachability

    Aaron R. Bradley;Zohar Manna;Henny B. Sipma

  • Practical methods for proving program termination

    Michael A. Colon;Henny B. Sipma

  • STeP: Deductive-Algorithmic Verification of Reactive and Real-Time Systems

    Nikolaj Bjørner;Anca Browne;Eddie Chang;Michael Colón

  • Termination of polynomial programs

    Aaron R. Bradley;Zohar Manna;Henny B. Sipma

  • Collecting Statistics Over Runtime Executions

    Bernd Finkbeiner;Sriram Sankaranarayanan;Henny B. Sipma

  • Constraint-Based Linear-Relations Analysis

    Sriram Sankaranarayanan;Henny B. Sipma;Zohar Manna

  • Verifying Temporal Properties of Reactive Systems: A STeP Tutorial

    Nikolaj S. Bjørner;Anca Browne;Michael A. Colón;Bernd Finkbeiner

  • The polyranking principle

    Aaron R. Bradley;Zohar Manna;Henny B. Sipma

  • Checking Finite Traces Using Alternating Automata

    Bernd Finkbeiner;Henny Sipma

  • Constructing Invariants for Hybrid Systems

    Sriram Sankaranarayanan;Henny B. Sipma;Zohar Manna

  • Constructing invariants for hybrid systems

    Sriram Sankaranarayanan;Henny B. Sipma;Zohar Manna

  • Termination analysis of integer linear loops

    Aaron R. Bradley;Zohar Manna;Henny B. Sipma

  • Deductive Model Checking

    Henny Sipma;Tomás E. Uribe;Zohar Manna

Frequent Co-Authors

Zohar Manna
Zohar Manna Stanford University
Sriram Sankaranarayanan
Sriram Sankaranarayanan University of Colorado Boulder
Bernd Finkbeiner
Bernd Finkbeiner Saarland University
Nikolaj Bjørner
Nikolaj Bjørner Microsoft (United States)
Christopher Gill
Christopher Gill Washington University in St. Louis
Luca de Alfaro
Luca de Alfaro University of California, Santa Cruz
Alexandre M. Bayen
Alexandre M. Bayen University of California, Berkeley
David L. Dill
David L. Dill Stanford University
Claire J. Tomlin
Claire J. Tomlin University of California, Berkeley

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

If you are considering studying Computer Science in the USA, there are multiple online degree options that can boost your career flexibility and growth. One path is starting with an associates degrees online, which offers foundational skills and quick entry into technology roles. These programs are generally more affordable and can help you determine your interest before investing in a higher degree.

For those who want to advance quickly, the shortest masters degree programs online let you earn a graduate credential in a streamlined timeframe. An online master’s in Computer Science from a recognized institution can open doors to advanced positions and higher salaries.

When choosing a program, consider the most useful masters degrees with high employer demand. Focusing on in-demand areas such as data science, artificial intelligence, or cybersecurity can enhance your career prospects even further.

Many students are concerned about tuition costs. Thankfully, there are affordable online colleges offering flexible learning without the financial burden. By selecting the right online Computer Science program, you can tailor your education to fit both your budget and career goals.

Best Scientists Citing Henny B. Sipma

Trending Scientists