Krishna, Shankara Narayanan
158  Ergebnisse:
Personensuche X
?
1

How Hard Is Weak-Memory Testing?:

Chakraborty, Soham ; Krishna, Shankara Narayanan ; Mathur, Umang.
Proceedings of the ACM on Programming Languages.  8 (2024)  POPL - p. 1978-2009 , 2024
 
?
3

Optimal Repair for Omega-Regular Properties:

, In: Automated Technology for Verification and Analysis; Lecture Notes in Computer Science,
 
?
5

Regular Model Checking with Regular Relations:

, In: Fundamentals of Computation Theory; Lecture Notes in Computer Science,
 
?
6

SD-regular transducer expressions for aperiodic transformat..:

, In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science,
 
?
 
?
8

Robust Controller Synthesis for Duration Calculus:

, In: Automated Technology for Verification and Analysis; Lecture Notes in Computer Science,
 
?
10

Timed systems through the lens of logic:

, In: Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science,
Akshay, S. ; Gastin, Paul ; Jugé, Vincent. - p. 1-13 , 2019
 
?
11

Perfect Timed Communication Is Hard:

, In: Lecture Notes in Computer Science; Formal Modeling and Analysis of Timed Systems,
 
?
12

Regular and First-Order List Functions:

, In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science,
 
?
13

Regular Transducer Expressions for Regular Transformations:

, In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science,
 
?
15

What's decidable about recursive hybrid automata?:

, In: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control,
 
1-15