受强制性开放获取政策约束的文章 - Shankara Narayanan Krishna了解详情
可在其他位置公开访问的文章：22 篇
Regular and first-order list functions
M Bojańczyk, L Daviaud, SN Krishna
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, European Commission
Adding negative prices to priced timed games
T Brihaye, G Geeraerts, S Narayanan Krishna, L Manasa, B Monmege, ...
International Conference on Concurrency Theory, 560-575, 2014
强制性开放获取政策： National Fund for Scientific Research, Belgium
Analyzing timed systems using tree automata
S Akshay, P Gastin, SN Krishna
Logical Methods in Computer Science 14, 2018
强制性开放获取政策： Department of Science & Technology, India
Synthesis of computable regular functions of infinite words
V Dave, E Filiot, S Krishna, N Lhote
Logical Methods in Computer Science 18, 2022
强制性开放获取政策： European Commission, Agence Nationale de la Recherche
Further results on generalised communicating P systems
SN Krishna, M Gheorghe, F Ipate, E Csuhaj-Varjú, R Ceterchi
Theoretical Computer Science 701, 146-160, 2017
强制性开放获取政策： National Office for Research, Development and Innovation, Hungary
The reach-avoid problem for constant-rate multi-mode systems
SN Krishna, A Kumar, F Somenzi, B Touri, A Trivedi
Automated Technology for Verification and Analysis: 15th International …, 2017
强制性开放获取政策： US Department of Defense, Department of Science & Technology, India
Overcoming Memory Weakness with Unified Fairness: Systematic Verification of Liveness in Weak Memory Models
PA Abdulla, MF Atig, A Godbole, S Krishna, M Vahanwala
International Conference on Computer Aided Verification, 184-205, 2023
强制性开放获取政策： US National Science Foundation, US Department of Defense, Department of …
Parameterized verification under release acquire is PSPACE-complete
S Krishna, A Godbole, R Meyer, S Chakraborty
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022
强制性开放获取政策： Department of Science & Technology, India
From non-punctuality to non-adjacency: A quest for decidability of timed temporal logics with quantifiers
SN Krishna, K Madnani, M Mazo Jr, P Pandya
Formal Aspects of Computing 35 (2), 1-50, 2023
强制性开放获取政策： European Commission
Optimal Reads-From Consistency Checking for C11-Style Memory Models
HC Tunç, PA Abdulla, S Chakraborty, S Krishna, U Mathur, ...
Proceedings of the ACM on Programming Languages 7 (PLDI), 761-785, 2023
强制性开放获取政策： Villum Foundation, Department of Science & Technology, India, Swedish …
Revisiting underapproximate reachability for multipushdown systems
S Akshay, P Gastin, S Krishna, S Roychowdhury
Tools and Algorithms for the Construction and Analysis of Systems: 26th …, 2020
强制性开放获取政策： Department of Science & Technology, India
Event-triggered and time-triggered duration calculus for model-free reinforcement learning
K Dole, A Gupta, J Komp, S Krishna, A Trivedi
2021 IEEE Real-Time Systems Symposium (RTSS), 240-252, 2021
强制性开放获取政策： US National Science Foundation
Generalizing non-punctuality for timed temporal logic with freeze quantifiers
SN Krishna, K Madnani, M Mazo, PK Pandya
Formal Methods: 24th International Symposium, FM 2021, Virtual Event …, 2021
强制性开放获取政策： European Commission
Correct-by-construction reinforcement learning of cardiac pacemakers from duration calculus requirements
K Dole, A Gupta, J Komp, S Krishna, A Trivedi
Proceedings of the AAAI Conference on Artificial Intelligence 37 (12), 14792 …, 2023
强制性开放获取政策： US National Science Foundation
Timed systems through the lens of logic
S Akshay, P Gastin, V Jugé, SN Krishna
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2019
强制性开放获取政策： Department of Science & Technology, India, Agence Nationale de la Recherche
On-The-Fly Static Analysis via Dynamic Bidirected Dyck Reachability
S Krishna, A Lal, A Pavlogiannis, O Tuppe
Proceedings of the ACM on Programming Languages 8 (POPL), 1239-1268, 2024
强制性开放获取政策： Villum Foundation, Department of Science & Technology, India
How Hard Is Weak-Memory Testing?
S Chakraborty, SN Krishna, U Mathur, A Pavlogiannis
Proceedings of the ACM on Programming Languages 8 (POPL), 1978-2009, 2024
强制性开放获取政策： Villum Foundation, Department of Science & Technology, India
Counter machines with infrequent reversals
A Finkel, SN Krishna, K Madnani, R Majumdar, G Zetzsche
43rd IARCS Annual Conference on Foundations of Software Technology and …, 2023
强制性开放获取政策： German Research Foundation, Agence Nationale de la Recherche
Optimal repair for omega-regular properties
V Dave, SN Krishna, V Murali, A Trivedi
International Symposium on Automated Technology for Verification and …, 2022
强制性开放获取政策： US National Science Foundation
Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable
SN Krishna, L Manasa, A Trivedi
Language and Automata Theory and Applications: 9th International Conference …, 2015
强制性开放获取政策： Department of Science & Technology, India
出版信息和资助信息由计算机程序自动确定