Recent publications

From Numerical Transition Systems
Jump to: navigation, search


  • M. Echenim, R. Iosif and N. Peltier. The Complexity of Prenex Separation Logic with One Selector arXiv:1804.03556
  • M. Echenim, R. Iosif and N. Peltier. On the Expressive Completeness of Bernays-Schönfinkel-Ramsey Separation Logic arXiv:1802.00195
  • R. Iosif and C. Serban. Complete Cyclic Proof Systems for Inductive Entailments arXiv:1707.02415
  • M. Bozga, R. Iosif and F. Konecny. The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops arXiv:1307.5321